LAB EXPERIMENT 1(EXPT 1-Array basic operations.cpp) Write a menu driven program that implements following operations on a linear array: •Insert a new element at a specified position •Delete an element either whose value is given or whose position is given •To find the location of a given element •To display the elements of the linear array
LAB EXPERIMENT 2(EXPT 2-Array Linear Search.cpp) Write a program to accept N numbers from the user and store them in an array. Then, accept another number from the user and search that using Linear Search.
LAB EXPERIMENT 3(EXPT 3-Bubble Sort & Binary Search.cpp) Write a program to accept N integers from the user and store them in an array. Sort the array in ascending order using Bubble sort. Then accept another number from the user, search whether that number exists in the array using Binary Search. If it does, display its index and if it doesn’t, then print that the number is not found in the array.
LAB EXPERIMENT 4(EXPT 4-Operations on Doubly and Circular Linked List.cpp) Write a menu driven program that implements the following operations on a doubly linked list and Circular Linked List : •Insert a new element at the beginning ,end and in-between the given list •Delete an existing element •Search an element •Display all the elements
LAB EXPERIMENT 5(EXPT 5(A)-Stack using Array.cpp,EXPT 5(B)-Stack using Linked List.cpp) Write a menu driven program that implements the following operations on a Stack(either implement as Linear array and as Linked list) : •Push •Pop •Display Top of the stack
LAB EXPERIMENT 6(EXPT 6-Infix to Postfix.cpp) Write a program to demonstrate the use of stack in converting arithmetic expression from infix notation to postfix notation and in evaluating arithmetic postfix expression.
LAB EXPERIMENT 7(EXPT 7-Circular Queue using Array.cpp) Menu driven Program to demonstrate the implementation of various operations on a Circular queue (using a linear array and a linked list)
LAB EXPERIMENT 8(EXPT 8-Insertion Sort.cpp) Write a program to accept N numbers in an array, and then sort the array using Insertion Sort. Then accept a number from the user and insert it in the array according to the sequential order
LAB EXPERIMENT 9(EXPT 9-Quick Sort.cpp) Write a program to accept N numbers in an array, and then sort the array using Quick Sort.
LAB EXPERIMENT 10(EXPT 10-Selection and Merge Sort.cpp) Write a program to accept N numbers from the user in one array and M numbers in another array. Then, sort the arrays using Selection Sort and then merge these two arrays using Merge Sort.
LAB EXPERIMENT 11(Exp.11-BST implementation.cpp) Write a menu driven program that implements the following operations on a Binary Search Tree(BST) : •Insert a new element •Delete an existing element •Traversing the tree •Pre-order Traversal •In-order Traversal •Post-order Traversal
LAB EXPERIMENT 12(EXPT 12-Heap Sort) Sort the list of integers using heap tree (Heap sort)
LAB EXPERIMENT 13(EXPT 13(A).cpp,EXPT 13(B).cpp) Program including all Operations on graph and illustrate the traversals using DFS and BFS