Degree 2nd Sem cs programs
1. C program to merge sort
ALGORITHM divide and conquer PROGRAM1. C program to insert element at specific position
ALGORITHM 1. Get the element value which needs to be inserted. 2. Get the position value. 3. Check whether the position value is valid or not. 4. If it is valid, Shift all the elements from the last index to position index by 1 position to the right. insert the new element in arr[position] 5. Otherwise, Invalid Position PROGRAM // C Program to Insert an element // at a specific position in an Array #include <stdio.h> int main() { int arr[100] = { 0 }; int i, x, pos, n = 10; for (i = 0; i < 10; i++) arr[i] = i + 1; for (i = 0; i < n; i++) printf("%d ", arr[i]); printf("\n"); x = 50; pos = 5; n++; for (i = n-1; i >= pos; i--) arr[i] = arr[i - 1]; arr[pos - 1] = x; for (i = 0; i < n; i++) printf("%d ", arr[i]); printf("\n"); return 0; } 2. C Program for STACK Using Arrays ALGORITHM Before implementing actual operations, first follow the below steps to create an empty stack. Step 1 - Include all the header files which are used in the program and define a constant 'SIZE' with specific value. Step 2 - Declare all the functions used in stack implementation. Step 3 - Create a one dimensional array with fixed size (int stack[SIZE]) Step 4 - Define a integer variable 'top' and initialize with '-1'. (int top = -1) Step 5 - In main method, display menu with list of operations and make suitable function calls to perform operation selected by the user on the stack. push(value) - Inserting value into the stack In a stack, push() is a function used to insert an element into the stack. In a stack, the new element is always inserted at top position. Push function takes one integer value as parameter and inserts that value into the stack. We can use the following steps to push an element on to the stack... Step 1 - Check whether stack is FULL. (top == SIZE-1) Step 2 - If it is FULL, then display "Stack is FULL!!! Insertion is not possible!!!" and terminate the function. Step 3 - If it is NOT FULL, then increment top value by one (top++) and set stack[top] to value (stack[top] = value). pop() - Delete a value from the Stack In a stack, pop() is a function used to delete an element from the stack. In a stack, the element is always deleted from top position. Pop function does not take any value as parameter. We can use the following steps to pop an element from the stack... Step 1 - Check whether stack is EMPTY. (top == -1) Step 2 - If it is EMPTY, then display "Stack is EMPTY!!! Deletion is not possible!!!" and terminate the function. Step 3 - If it is NOT EMPTY, then delete stack[top] and decrement top value by one (top--). display() - Displays the elements of a Stack We can use the following steps to display the elements of a stack... Step 1 - Check whether stack is EMPTY. (top == -1) Step 2 - If it is EMPTY, then display "Stack is EMPTY!!!" and terminate the function. Step 3 - If it is NOT EMPTY, then define a variable 'i' and initialize with top. Display stack[i] value and decrement i value by one (i--). Step 3 - Repeat above step until i value becomes '0'. PROGRAM #include<stdio.h> #include<conio.h> #define SIZE 10 void push(int); void pop(); void display(); int stack[SIZE], top = -1; void main() { int value, choice; clrscr(); while(1){ printf("\n\n***** MENU *****\n"); printf("1. Push\n2. Pop\n3. Display\n4. Exit"); printf("\nEnter your choice: "); scanf("%d",&choice); switch(choice){ case 1: printf("Enter the value to be insert: "); scanf("%d",&value); push(value); break; case 2: pop(); break; case 3: display(); break; case 4: exit(0); default: printf("\nWrong selection!!! Try again!!!"); } } } void push(int value){ if(top == SIZE-1) printf("\nStack is Full!!! Insertion is not possible!!!"); else{ top++; stack[top] = value; printf("\nInsertion success!!!"); } } void pop(){ if(top == -1) printf("\nStack is Empty!!! Deletion is not possible!!!"); else{ printf("\nDeleted : %d", stack[top]); top--; } } void display(){ if(top == -1) printf("\nStack is Empty!!!"); else{ int i; printf("\nStack elements are:\n"); for(i=top; i>=0; i--) printf("%d\n",stack[i]); } } 3. STACK PROGRAM USING LINKED LIST ALGORITH To implement a stack using a linked list, we need to set the following things before implementing actual operations. Step 1 - Include all the header files which are used in the program. And declare all the user defined functions. Step 2 - Define a 'Node' structure with two members data and next. Step 3 - Define a Node pointer 'top' and set it to NULL. Step 4 - Implement the main method by displaying Menu with list of operations and make suitable function calls in the main method. push(value) - Inserting an element into the Stack We can use the following steps to insert a new node into the stack... Step 1 - Create a newNode with given value. Step 2 - Check whether stack is Empty (top == NULL) Step 3 - If it is Empty, then set newNode ? next = NULL. Step 4 - If it is Not Empty, then set newNode ? next = top. Step 5 - Finally, set top = newNode. pop() - Deleting an Element from a Stack We can use the following steps to delete a node from the stack... Step 1 - Check whether stack is Empty (top == NULL). Step 2 - If it is Empty, then display "Stack is Empty!!! Deletion is not possible!!!" and terminate the function Step 3 - If it is Not Empty, then define a Node pointer 'temp' and set it to 'top'. Step 4 - Then set 'top = top ? next'. Step 5 - Finally, delete 'temp'. (free(temp)). display() - Displaying stack of elements We can use the following steps to display the elements (nodes) of a stack... Step 1 - Check whether stack is Empty (top == NULL). Step 2 - If it is Empty, then display 'Stack is Empty!!!' and terminate the function. Step 3 - If it is Not Empty, then define a Node pointer 'temp' and initialize with top. Step 4 - Display 'temp ? data --->' and move it to the next node. Repeat the same until temp reaches to the first node in the stack. (temp ? next != NULL). Step 5 - Finally! Display 'temp ? data ---> NULL'. PROGRAM #include<stdio.h> #include<conio.h> struct Node { int data; struct Node *next; }*top = NULL; void push(int); void pop(); void display(); void main() { int choice, value; clrscr(); printf("\n:: Stack using Linked List ::\n"); while(1){ printf("\n****** MENU ******\n"); printf("1. Push\n2. Pop\n3. Display\n4. Exit\n"); printf("Enter your choice: "); scanf("%d",&choice); switch(choice){ case 1: printf("Enter the value to be insert: "); scanf("%d", &value); push(value); break; case 2: pop(); break; case 3: display(); break; case 4: exit(0); default: printf("\nWrong selection!!! Please try again!!!\n"); } } } void push(int value) { struct Node *newNode; newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = value; if(top == NULL) newNode->next = NULL; else newNode->next = top; top = newNode; printf("\nInsertion is Success!!!\n"); } void pop() { if(top == NULL) printf("\nStack is Empty!!!\n"); else{ struct Node *temp = top; printf("\nDeleted element: %d", temp->data); top = temp->next; free(temp); } } void display() { if(top == NULL) printf("\nStack is Empty!!!\n"); else{ struct Node *temp = top; while(temp->next != NULL){ printf("%d--->",temp->data); temp = temp -> next; } printf("%d--->NULL",temp->data); } } 4. QUEUE PROGRAM USING ARRAYS ALGORITHM Before we implement actual operations, first follow the below steps to create an empty queue. Step 1 - Include all the header files which are used in the program and define a constant 'SIZE' with specific value. Step 2 - Declare all the user defined functions which are used in queue implementation. Step 3 - Create a one dimensional array with above defined SIZE (int queue[SIZE]) Step 4 - Define two integer variables 'front' and 'rear' and initialize both with '-1'. (int front = -1, rear = -1) Step 5 - Then implement main method by displaying menu of operations list and make suitable function calls to perform operation selected by the user on queue. enQueue(value) - Inserting value into the queue In a queue data structure, enQueue() is a function used to insert a new element into the queue. In a queue, the new element is always inserted at rear position. The enQueue() function takes one integer value as a parameter and inserts that value into the queue. We can use the following steps to insert an element into the queue... Step 1 - Check whether queue is FULL. (rear == SIZE-1) Step 2 - If it is FULL, then display "Queue is FULL!!! Insertion is not possible!!!" and terminate the function. Step 3 - If it is NOT FULL, then increment rear value by one (rear++) and set queue[rear] = value. deQueue() - Deleting a value from the Queue In a queue data structure, deQueue() is a function used to delete an element from the queue. In a queue, the element is always deleted from front position. The deQueue() function does not take any value as parameter. We can use the following steps to delete an element from the queue... Step 1 - Check whether queue is EMPTY. (front == rear) Step 2 - If it is EMPTY, then display "Queue is EMPTY!!! Deletion is not possible!!!" and terminate the function. Step 3 - If it is NOT EMPTY, then increment the front value by one (front ++). Then display queue[front] as deleted element. Then check whether both front and rear are equal (front == rear), if it TRUE, then set both front and rear to '-1' (front = rear = -1). display() - Displays the elements of a Queue We can use the following steps to display the elements of a queue... Step 1 - Check whether queue is EMPTY. (front == rear) Step 2 - If it is EMPTY, then display "Queue is EMPTY!!!" and terminate the function. Step 3 - If it is NOT EMPTY, then define an integer variable 'i' and set 'i = front+1'. Step 4 - Display 'queue[i]' value and increment 'i' value by one (i++). Repeat the same until 'i' value reaches to rear (i <= rear) PROGRAM #include<stdio.h> #include<conio.h> #define SIZE 10 void enQueue(int); void deQueue(); void display(); int queue[SIZE], front = -1, rear = -1; void main() { int value, choice; clrscr(); while(1){ printf("\n\n***** MENU *****\n"); printf("1. Insertion\n2. Deletion\n3. Display\n4. Exit"); printf("\nEnter your choice: "); scanf("%d",&choice); switch(choice){ case 1: printf("Enter the value to be insert: "); scanf("%d",&value); enQueue(value); break; case 2: deQueue(); break; case 3: display(); break; case 4: exit(0); default: printf("\nWrong selection!!! Try again!!!"); } } } void enQueue(int value){ if(rear == SIZE-1) printf("\nQueue is Full!!! Insertion is not possible!!!"); else{ if(front == -1) front = 0; rear++; queue[rear] = value; printf("\nInsertion success!!!"); } } void deQueue(){ if(front == rear) printf("\nQueue is Empty!!! Deletion is not possible!!!"); else{ printf("\nDeleted : %d", queue[front]); front++; if(front == rear) front = rear = -1; } } void display(){ if(rear == -1) printf("\nQueue is Empty!!!"); else{ int i; printf("\nQueue elements are:\n"); for(i=front; i<=rear; i++) printf("%d\t",queue[i]); } } 5. QUEUE USING LINKED LIST ALGORITHM To implement queue using linked list, we need to set the following things before implementing actual operations. Step 1 - Include all the header files which are used in the program. And declare all the user defined functions. Step 2 - Define a 'Node' structure with two members data and next. Step 3 - Define two Node pointers 'front' and 'rear' and set both to NULL. Step 4 - Implement the main method by displaying Menu of list of operations and make suitable function calls in the main method to perform user selected operation. enQueue(value) - Inserting an element into the Queue We can use the following steps to insert a new node into the queue... Step 1 - Create a newNode with given value and set 'newNode ? next' to NULL. Step 2 - Check whether queue is Empty (rear == NULL) Step 3 - If it is Empty then, set front = newNode and rear = newNode. Step 4 - If it is Not Empty then, set rear ? next = newNode and rear = newNode. deQueue() - Deleting an Element from Queue We can use the following steps to delete a node from the queue... Step 1 - Check whether queue is Empty (front == NULL). Step 2 - If it is Empty, then display "Queue is Empty!!! Deletion is not possible!!!" and terminate from the function Step 3 - If it is Not Empty then, define a Node pointer 'temp' and set it to 'front'. Step 4 - Then set 'front = front ? next' and delete 'temp' (free(temp)). display() - Displaying the elements of Queue We can use the following steps to display the elements (nodes) of a queue... Step 1 - Check whether queue is Empty (front == NULL). Step 2 - If it is Empty then, display 'Queue is Empty!!!' and terminate the function. Step 3 - If it is Not Empty then, define a Node pointer 'temp' and initialize with front. Step 4 - Display 'temp ? data --->' and move it to the next node. Repeat the same until 'temp' reaches to 'rear' (temp ? next != NULL). Step 5 - Finally! Display 'temp ? data ---> NULL'. PROGRAM #include<stdio.h> #include<conio.h> struct Node { int data; struct Node *next; }*front = NULL,*rear = NULL; void insert(int); void delete(); void display(); void main() { int choice, value; clrscr(); printf("\n:: Queue Implementation using Linked List ::\n"); while(1){ printf("\n****** MENU ******\n"); printf("1. Insert\n2. Delete\n3. Display\n4. Exit\n"); printf("Enter your choice: "); scanf("%d",&choice); switch(choice){ case 1: printf("Enter the value to be insert: "); scanf("%d", &value); insert(value); break; case 2: delete(); break; case 3: display(); break; case 4: exit(0); default: printf("\nWrong selection!!! Please try again!!!\n"); } } } void insert(int value) { struct Node *newNode; newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = value; newNode -> next = NULL; if(front == NULL) front = rear = newNode; else{ rear -> next = newNode; rear = newNode; } printf("\nInsertion is Success!!!\n"); } void delete() { if(front == NULL) printf("\nQueue is Empty!!!\n"); else{ struct Node *temp = front; front = front -> next; printf("\nDeleted element: %d\n", temp->data); free(temp); } } void display() { if(front == NULL) printf("\nQueue is Empty!!!\n"); else{ struct Node *temp = front; while(temp->next != NULL){ printf("%d--->",temp->data); temp = temp -> next; } printf("%d--->NULL\n",temp->data); } } 6. Write a program for Binary Search Tree Traversals #include <stdio.h> #include <stdlib.h> struct node { int data; struct node *leftChild; struct node *rightChild; }; struct node *root = NULL; void insert(int data) { struct node *tempNode = (struct node*) malloc(sizeof(struct node)); struct node *current; struct node *parent; tempNode->data = data; tempNode->leftChild = NULL; tempNode->rightChild = NULL; //if tree is empty if(root == NULL) { root = tempNode; } else { current = root; parent = NULL; while(1) { parent = current; //go to left of the tree if(data < parent->data) { current = current->leftChild; //insert to the left if(current == NULL) { parent->leftChild = tempNode; return; } } //go to right of the tree else { current = current->rightChild; //insert to the right if(current == NULL) { parent->rightChild = tempNode; return; } } } } } struct node* search(int data) { struct node *current = root; printf("Visiting elements: "); while(current->data != data) { if(current != NULL) printf("%d ",current->data); //go to left tree if(current->data > data) { current = current->leftChild; } //else go to right tree else { current = current->rightChild; } //not found if(current == NULL) { return NULL; } } return current; } void pre_order_traversal(struct node* root) { if(root != NULL) { printf("%d ",root->data); pre_order_traversal(root->leftChild); pre_order_traversal(root->rightChild); } } void inorder_traversal(struct node* root) { if(root != NULL) { inorder_traversal(root->leftChild); printf("%d ",root->data); inorder_traversal(root->rightChild); } } void post_order_traversal(struct node* root) { if(root != NULL) { post_order_traversal(root->leftChild); post_order_traversal(root->rightChild); printf("%d ", root->data); } } int main() { int i; int array[7] = { 27, 14, 35, 10, 19, 31, 42 }; for(i = 0; i < 7; i++) insert(array[i]); i = 31; struct node * temp = search(i); if(temp != NULL) { printf("[%d] Element found.", temp->data); printf("\n"); }else { printf("[ x ] Element not found (%d).\n", i); } i = 15; temp = search(i); if(temp != NULL) { printf("[%d] Element found.", temp->data); printf("\n"); }else { printf("[ x ] Element not found (%d).\n", i); } printf("\nPreorder traversal: "); pre_order_traversal(root); printf("\nInorder traversal: "); inorder_traversal(root); printf("\nPost order traversal: "); post_order_traversal(root); return 0; } 7. C program for Binary Search #include <stdio.h> int main() { int c, first, last, middle, n, search, array[100]; printf("Enter number of elements\n"); scanf("%d", &n); printf("Enter %d integers\n", n); for (c = 0; c < n; c++) scanf("%d", &array[c]); printf("Enter value to find\n"); scanf("%d", &search); first = 0; last = n - 1; middle = (first+last)/2; while (first <= last) { if (array[middle] < search) first = middle + 1; else if (array[middle] == search) { printf("%d found at location %d.\n", search, middle+1); break; } else last = middle - 1; middle = (first + last)/2; } if (first > last) printf("Not found! %d isn't present in the list.\n", search); return 0; } 8. C program for Linear Search #include <stdio.h> int main() { int array[100], search, c, n; printf("Enter number of elements in array\n"); scanf("%d", &n); printf("Enter %d integer(s)\n", n); for (c = 0; c < n; c++) scanf("%d", &array[c]); printf("Enter a number to search\n"); scanf("%d", &search); for (c = 0; c < n; c++) { if (array[c] == search) /* If required element is found */ { printf("%d is present at location %d.\n", search, c+1); break; } } if (c == n) printf("%d isn't present in the array.\n", search); return 0; } 9. C program for Bubble Sort #include <stdio.h> int main() { int array[100], n, c, d, swap; printf("Enter number of elements\n"); scanf("%d", &n); printf("Enter %d integers\n", n); for (c = 0; c < n; c++) scanf("%d", &array[c]); for (c = 0 ; c < n - 1; c++) { for (d = 0 ; d < n - c - 1; d++) { if (array[d] > array[d+1]) /* For decreasing order use '<' instead of '>' */ { swap = array[d]; array[d] = array[d+1]; array[d+1] = swap; } } } printf("Sorted list in ascending order:\n"); for (c = 0; c < n; c++) printf("%d\n", array[c]); return 0; } 10. C program for insertion sort /* Insertion sort ascending order */ #include <stdio.h> int main() { int n, array[1000], c, d, t, flag = 0; printf("Enter number of elements\n"); scanf("%d", &n); printf("Enter %d integers\n", n); for (c = 0; c < n; c++) scanf("%d", &array[c]); for (c = 1 ; c <= n - 1; c++) { t = array[c]; for (d = c - 1 ; d >= 0; d--) { if (array[d] > t) { array[d+1] = array[d]; flag = 1; } else break; } if (flag) array[d+1] = t; } printf("Sorted list in ascending order:\n"); for (c = 0; c <= n - 1; c++) { printf("%d\n", array[c]); } return 0; } 11. C program to implement Depth first Search #include<stdio.h> #include<conio.h> int a[20][20],reach[20],n; void dfs(int v) { int i; reach[v]=1; for (i=1;i<=n;i++) if(a[v][i] && !reach[i]) { printf("\n %d->%d",v,i); dfs(i); } } void main() { int i,j,count=0; clrscr(); printf("\n Enter number of vertices:"); scanf("%d",&n); for (i=1;i<=n;i++) { reach[i]=0; for (j=1;j<=n;j++) a[i][j]=0; } printf("\n Enter the adjacency matrix:\n"); for (i=1;i<=n;i++) for (j=1;j<=n;j++) scanf("%d",&a[i][j]); dfs(1); printf("\n"); for (i=1;i<=n;i++) { if(reach[i]) count++; } if(count==n) printf("\n Graph is connected"); else printf("\n Graph is not connected"); getch(); } 12. C program for Breadth First Search #include<stdio.h> #include<conio.h> int a[20][20],q[20],visited[20],n,i,j,f=0,r=-1; void bfs(int v) { for (i=1;i<=n;i++) if(a[v][i] && !visited[i]) q[++r]=i; if(f<=r) { visited[q[f]]=1; bfs(q[f++]); } } void main() { int v; clrscr(); printf("\n Enter the number of vertices:"); scanf("%d",&n); for (i=1;i<=n;i++) { q[i]=0; visited[i]=0; } printf("\n Enter graph data in matrix form:\n"); for (i=1;i<=n;i++) for (j=1;j<=n;j++) scanf("%d",&a[i][j]); printf("\n Enter the starting vertex:"); scanf("%d",&v); bfs(v); printf("\n The node which are reachable are:\n"); for (i=1;i<=n;i++) if(visited[i]) printf("%d\t",i); else printf("\n Bfs is not possible"); getch(); }
Comments
Post a Comment