® PES University PES. wo recente eg pe 05 Department of Compater Slee and Engineering, ind Semester Evamisation ~AUE-DeC 2019 Data Structures Laboratory - UEI8CS207 ‘Time: 2 Hours Tnstractions to Students: [Stunts ae required write ony the required futons & execute the complete Prsram, 2 Marks split up: Wete wp 6 marks, Conduction ~ 1 marks. 5. Change of pogram -5 marks wl be ct. Students ae allowed to take change only twice. 4 taser & Diplay funstons should be writen wherever applicable |. Wwete a program to perfor the following operation using a Singly Linke List a Sate fora pariular element node 1 Delete rom end ofthe list, 2. Wat program to perform he fllowing operation using a Singly Linked List ‘a Ondered Insertion Print he alternate elements inthe fist. 3. Write program wo perform the fllowing operations using a Doubly Linked List 8 Position insertion Position Deletion 4. Implement Josephus problem using circular is ‘a, Weta program to implement onveran nfs expresion to posts fom using tack, 1 Wet program to compute the frst n fabinocei series using recursion, {6 Write program perform the fllowing implementation using a sack 2: Postfix evaluation Tower of Hanoi (Recursion) +. Write program implementa queue using linked ist and perform te following operations 4 Inser rear end Delete at font end '. Write program to construct a Binary Tree using ray traverse the tre sing ior & postorder ‘raverst! 9. Writ program to construct a Binary Search Tre using Linked List traverse te wee using preorder traversal, Also count the nmber of ea nes and compute the height ofthe ee 10, Construct «graph and traverse using the BFS- using queuesDFS-sng tack, Also count them umber ofeompoaems in the graph11, Construct a Min Heap Tre using Top Down approach 12) Consrvt a Max Heap using Botom-op approach 13. lmplement priority queue using heap 14, Construsta Threaded Binary Tre and traverse using preorder traversal 15, Construct an expression tre for nfx expression, Also evaluate the expresion and terse the tre using poste aver 16 Implement he fllowing using Tres: u 1 Seach a word based on prefs Delete the woe 17. plement hashing technique to avoid collision using separate chaining. 18, plement hashing technique to avoid collision using linear probing, Pepgmemercse. owpoematltzagen eis Aeon ‘00 Ft Ring Road, BSK 2d S19 'BANGALORE-500085