Tech Fun Learning

  How to access Computer share folder in Mobile | #Share​ files between Mobile and Computer | #Share How to access Computer share folder in Mobile | #Share ​ files between Mobile and Computer | #Share FolderAccess ​ In this video we will see how to share file between mobile and computer without using a USB Cable , this video is all about wireless file transfer between computer and mobile using computer share folder.

  How to Lock Folder in Windows Quick and Easy? | windows me folder lock kare hindi #FolderLock​ #TFL How to Lock Folder in Windows Quick and Easy? | windows me folder lock kare hindi #FolderLock ​ #TFL ​ To download file click link given below. https://drive.google.com/drive/folder...

How to Install Tomcat 8.5 on Ubuntu/Linux - Apache Tomcat-8.5.5 Step : Create Tomcat User ->  sudo groupadd tomcat Next, create a new tomcat user. We'll make this user a member of the tomcat group, with a home directory of /opt/tomcat (where we will install Tomcat), and with a shell of /bin/false (so nobody can log into the account): ->  sudo useradd -s /bin/false -g tomcat -d /opt/tomcat tomcat Now that our tomcat user is set up, let's download and install Tomcat. Step 2: Install Tomcat cd /tmp curl -O http://apache.mirrors.ionfish.org/tomcat/tomcat-8/v8.5.5/bin/apache-tomcat-8.5.5.tar.gz     sudo mkdir /opt/tomcat     sudo tar xzvf apache-tomcat-8*tar.gz -C /opt/tomcat --strip-components=1 Step 3: Update Permissions cd /opt/tomcat sudo chgrp -R tomcat /opt/tomcat     sudo chmod -R g+r conf     sudo chmod g+x conf sudo chown -R tomcat webapps/ work/ temp/ logs/ Step 4: Create a systemd Service File sudo update-java-alternatives -l...

How To Install MySQL on Ubuntu/Linux   My Sql  Commands To check your hostname run: hostname hostname -f update--------------------- sudo apt-get update sudo apt-get upgrade Install MySQL: prompted to set a password for the MySQL root user:MySQL will bind to localhost (127.0.0.1) by default: sudo apt-get install mysql-server Harden MySQL Server: sudo mysql_secure_installation To log in to MySQL as the root user: mysql -u root -p show databases; //JAVA installation-------------------------------------------------- Then, check if Java is not already installed: java -version sudo apt install openjdk-8-jre-headless sudo apt-get install default-jre sudo apt-get install default-jdk

Binary Search Tree C Program to implement a Binary Search Tree and perform deletion, inorder traversal on it     #include <stdio.h>     #include <stdlib.h>           struct btnode     {         int value;         struct btnode *l;         struct btnode *r;     }*root = NULL, *temp = NULL, *t2, *t1;           void delete1();     void insert();     void delete();     void inorder(struct btnode *t);     void create();     void search(struct btnode *t);     void preorder(struct btnode *t);     void postorder(struct btnode *t);     void search1(struct btnode *t,int data);     int smallest(struct btnode *t);     int largest(struct btnode *t);     void main()     {         int ch;     ...

Doubly linked list Insertion in C: C program to create, insert, delete, search, delete display in doubly linked list #include <stdio.h>   #include <stdlib.h>   struct node {         int data;         struct node *next, *prev;   };   struct node *head = NULL, *tail = NULL;   int nodeCount = 0;   struct node * createNode(int data) {         struct node *newnode;         newnode = (struct node *)malloc(sizeof (struct node));         newnode->data = data;         newnode->next = NULL;         newnode->prev = NULL;         return (newnode);   }   void createDummies() {         head = (struct node *)malloc(sizeof (struct node));         tail = (struct node *)malloc(sizeof (struct node));         head->data = tail-...

Singly Linked List C Exercises: To create, add, add after, display, modify and delete in Singly Linked List #include<stdio.h> #include<stdlib.h>   struct node {     int data;     struct node *next; }*head;       void append(int num) {     struct node *temp,*right;     temp= (struct node *)malloc(sizeof(struct node));     temp->data=num;     right=(struct node *)head;     while(right->next != NULL)     right=right->next;     right->next =temp;     right=temp;     right->next=NULL; }       void add( int num ) {     struct node *temp;     temp=(struct node *)malloc(sizeof(struct node));     temp->data=num;     if (head== NULL)     {     head=temp;     head->next=NULL;     }     else     {     temp->next=...