DATA STRUCTURES LAB External EXAM - 2022
SET-1: a) Implementation of Breadth First Search(BFS) b) Queue ADT Using Linked List. SET-2: a) Implementation of Depth First Search(DFS) b) Circular Queue Implementation. SET-3: a) Stack and Queue ADT using Array. b) Double-ended Queue using Array. SET-4: a) Single Linked List implementation with any 4 operations. b) Bubble Sort. SET-5: a) Double Linked List implementation with any 4 operations. b) Selection Sort. SET-6: a) BST implementation with the following operations create,display,search,delete . b) Insertion Sort. SET-7: a) Infix to Postfix conversion using Stack. b) Merge Sort. SET-8: a) Balancing Symbols using Stack. b) Quick Sort. SET-9: a) Postfix Evaluation using Stack. b) Heap Sort. SET-10: a) Stack ADT using Linked List. b) Implementation of Binary Tree Traversals. External Examiner -------------------------- Mr. M.Naveen, Asst. Prof, RVR&JC