Linux Tips & Tricks, C Programs ...

        /**     Module Name: Tower of Hanoi     Description: This Program is done using Recursion     Author:  Tauqirul Haque     */ void towerOfHanio(int, char, char, char);  int main() {     clrscr();     int disk ;     printf("Enter The Number of Disk :  ");     scanf("%d",&disk);         int move = (int)(pow(2,disk)-1);     printf("\nTotal Number of Moves are #  %d \n",move);             towerOfHanio(disk, 'A','C','B');  // a= source, c = destination , b = temp         printf("\n");     return 0;     } void towerOfHanio(int disk, char source, char destination, char temp) {     if(disk == 1)     {...

/**     Program Name: STACK     Description: This Program Implements Stack using Linked List     Author:  Tauqirul Haque         */     struct StackLinkedList {     int item;     char name[30];     struct StackLinkedList *next; }; typedef struct StackLinkedList node; void push(node **); void pop(node **); void display(node **); void main() {     node *top = NULL;     int choice, item;         while(choice != 4)     {         printf("\n\t\t\t1. Push Element");         printf("\n\t\t\t2. Pop Element ");         printf("\n\t\t\t3. Display Stack");         printf("\n\t\t\t4. Exit Program");        ...

/**     Program Name: STACK     Description: This Program implements Stack Data Structure using Linear Array     Author:  Tauqirul Haque         */         #define SIZE 5 int stack[SIZE]; int top = -1; // this is the initial condition void push(); void pop(); void display(); int main() {     int choice;     while(choice != 4)     {         printf("\n\t\t\t1. Push an Element ");         printf("\n\t\t\t2. POP an Element");         printf("\n\t\t\t3. Display The Stack");         printf("\n\t\t\t4. Exit Program");                 printf("\nEnter Your Choice #  ");         scanf("%d",&choice); ...

/**     Program Name: Singly Linked List     Description: This Program is for Implemeting Singly Linked List     Author:  Tauqirul Haque         */ struct Linklist {     int item;     struct Linklist *next; }; typedef struct Linklist node; void insertAtBeginning(node **); void createAppendNode(node **); void insertInMiddle(node **); void deleteNode(node **); void displayNode(node **); void countNode(node **);  void searchElement(node **); void reverse(node **); void main() {     node *head = NULL;     int choice = 0;     while(choice != 9)     {             printf("\n\t\t\t1. Add Node At The Beginning ");     printf("\n\t\t\t2. Insert Element in the Middle ");     printf("\n\t\t\t3. Append New Node "); ...

/**     Program Name: SIMPLE QUEUE     Description: This program is for Implementing Simple QUEUE     Author:  Tauqirul Haque         */ #define SIZE 3 int front = -1; int rear = -1; int queue[SIZE]; void deleteElement(); void insertElement(); void displayElement(); void main() {     int ch;     while(ch !=4)     {         printf("\n\t\t1. Insert into queue..\n");         printf("\t\t2. Delete From Queue...\n");         printf("\t\t3. Diplay Queue...\n");         printf("\t\t4. Exit Program ...\n");                 printf("Enter Your Choice #  ");         scanf("%d",&ch);         ...

/**     Program Name: MATRIX MULTIPLICATION     Description: This program finds Product of Two Matrices     Author:  Tauqirul Haque         */ #define ROW1 2    //Change the Dimension According to Your need #define COL1 2 #define ROW2 2 #define COL2 2 void productMatrix(int matrix[][COL1], int matrixB[][COL2], int productMatrix[][COL2]); void displayMatrix(int matrix[ROW1][COL2]); //this function displays the matrix void main() {     int matrixA[ROW1][COL1] = { 1,1,1,1 };     int matrixB[ROW2][COL2] = { 2,2,2,2 };     int proMatrix[ROW1][COL2]={0};  //this will store the product of two matrices         printf("\nThe Element of the First Matrix is...\n");        displayMatrix(matrixA);         printf("\nThe Element of the Secon...

/**     Program Name: LINEAR SEARCH     Description: This program finds a given Item in an Array     Author:  Tauqirul Haque         */         #define SIZE 5 void linearSearch(int data[], int item); void displayElement(int data[]); void main() {     int data[SIZE] = { 56,34,75,24,76};     int item;     int choice;         while(choice != 3)     {         printf("\n\t\t 1. Search an Item ");         printf("\n\t\t 2. Display The Elements ");         printf("\n\t\t 3. Quit the Program");         printf("\n\n\t\t Enter Your Choice #  ");                 scanf("%d",&choice); ...

/**     Program Name: FINDING FACTORIAL     Description: This Program finds a Factorial of a Given Number     Author:  Tauqirul Haque         */ long fact(long n); void main() {     long n;     printf("Enter N : ");     scanf("%d",&n);         if(n < 0)   //if its a neg number then changing the sign     {         n = -n;     }         printf("The fact of %ld  =  %ld \n\n",n,fact(n)); } long fact(long n) {     if(n==0 || n==1)     {         return 1;     }     else     {         return n*fact(n-1);     } }

/**     Program Name: Circular Queue     Description: Circular Queue using Array     Author:  Tauqirul Haque         */ int front = -1;  //This is the Initial Condition int rear = -1; #define SIZE 5 int queue[SIZE]; void deleteElement(); void insertElement(); void displayElement(); void main() {     int ch;     while(ch !=4)     {         printf("\n\t\t1. Insert into queue..\n");         printf("\t\t2. Delete From Queue...\n");         printf("\t\t3. Diplay Queue...\n");         printf("\t\t4. Exit Program ...\n");                 printf("Enter Your Choice #  ");         scanf("%d",&ch);     ...

/**     Program Name: BUBBLE SORT     Description: This Program sorts a Given Array in Ascending Order     Author:  Tauqirul Haque         */ #define SIZE 10 void bubbleSort(int data[SIZE]); void displayElement(int data[SIZE]); void main() {     int data[SIZE] = { 45,34,66,89,45,34,76,22,79, 12};         printf("\nThe Original Array Before Sorting ... ");     displayElement(data);         printf("\nArray After Sorting ... ");     bubbleSort(data);     displayElement(data);     } void displayElement(int data[SIZE]) {     int i;     for(i=0; i     {         printf("\nData[%d]  =  %d",i,data[i]);     }     printf("\n"); } void ...

/**     Program Name: Binary Search     Description: This Program Searches for an Item in an integer Array     Author:  Tauqirul Haque         */     #define SIZE 10 void displayElement(int data[SIZE]); void binarySearch(int data[], int); void displayElement(int data[SIZE]) {     int i;         for(i=0; i     {         printf("\n Data[%d] = %d ", i+1, data[i]);     }         printf("\n"); } void main() {     int data[SIZE] = {12,24,56,58,78,90,91,99,100,107};         int item;     int choice;         while(choice != 3)     {         printf("\n\t\t 1. Search an Item ");     ...