1) Implement Queue using integer data. 2) Implement BFS of graph using queue as above. 3) Implement stack for characters.

4) Create Linked list & sort it in ascending order. 5) Implement Merge function to merge two lists. 6) Implement recursive merge sort method to sort list of integer value. 7) Read and sort two lists of student data (Roll no, Name, Marks) using Bubble sort

on Roll no. Display these lists.

8) Merge these two lists using merging method. Display the result. 9) Implement stack using integer data. 10) Implement DFS of graph. 11) Manipulate and display the shortest path using Dijkstras algorithm. 12) Read & display undirected graph. 13) Sort a string in ascending order using Quick Sort Method. 14) Build Heap tree to represent list of integer values. And display. 15) Sort the list using heap sort. Display the list. 16) Sort a given list using Radix sort. 17) Implement Link list to store and display list of employee

data (Emp ID, Name, City).

18) Write a program on Circular Queue.

19) Implement Circular Link List to store list of employee data (Emp ID, Name, City) in the order of Emp ID.
20) Display Emp data with city= Shirpur 21) Implement Infix to Postfix Expression using stack. 22) Sort integer data in ascending order using selection sort method. 23) Read and store integers in a Binary search Tree (BST). 24) Demonstrate In order & Preorder Traversal for above tree. 25) Read n integers in a linked list and display it. 26) Split the list in two for even and odd items. Display the lists after split operation. 27) Create link list in ascending order and display the list. 28) Create two separate list as above and merge them in single list so that the

resultant list is also in ascending order. Display the resultant list.

29) Create link list in ascending order and display it. 30) Delete the node in the above linked list according to position of node. 31) Implement Selection sort for characters in Descending order.

32) Create Singly Linked List & reverse it. 33) Implement Circular Queue for integers. 34) Create singly linked list, Search particular node according to info & show the

sum all nodes of linked list.

35) Create Linked list for integer & split it into positive & negative linked list. 36) Perform recursive Merge sort for integers in ascending order. 37) Perform Bubble sort for strings. 38) Implement Queue using linked list. 39) Implement Queue using character data. 40) Implement BFS of graph using queue. 41) Implement Tower of Hanoi. 42) Create Linked list & sort it in descending order. 43) Implement doubly linked list to store the student data. (Roll No, Name, Marks) &

display it.
44) Read and sort integer data using Insertion Sort. 45) Implement circular linked list which perform insert (),delete (),show ()operations. 46) Implement Insertion sort for integers to sort it in ascending order. 47) Implement stack to store alphabets in small letters and display in reverse order in

capital letter.
48) Build Max Heap tree to represent list of integer values. And display. 49) Manipulate and display the minimum spanning tree using Kruskal algorithm. 50) Implement link list as stack. 51) Implement link list to represent polynomial to read and display it. 52) Implement addition of two polynomials. 53) Implement Simple linear queue of integers. 54) Build BST of integers and implement tree traversals. 55) Implement Radix sort for integers. 56) Build Min heap Tree for integer data. 57) Read & sort an integer array using insertion sort. 58) Implement Binary search on above list.

59) Read and display directed graph with indegree and outdegree of each vertex. 60) Manipulate and display the minimum spanning tree using Prims algorithm.