Engineering BE Computer Engineering Sem 3 December 2022 2022 Data Structure Question Paper - Mumbai University | munotes

Questions asked in this paper

• (3) Figures to the right indicate full marks

1. Q1 (a) Compare linear and non-linear data structures. 5 marks
   • (b) Explain the advantage of circular queue over linear queue. Write a function in C language to insert an element in circular queue 5
   • (c) Define binary search tree. Discuss the case of deletion of anode in binary search tree if node has both the children
   • (d) Write a C function to search a node in doubly linked-list. 5
2. Q2 (a) Construct AVL tree for the following sequence: 10 marks
   • (b) Write algorithm for postfix evaluation. Demonstrate the same step by step for the expression: 9 67 * 2/
   • (a) Write a program to perform following operations on a circular linked list:
   • i) insert a node from the end of the list, ii) delete first node,
   • iii) count the number of nodes with even values, iv) display the list
   • (b) Write aC program to simulate linear queue as linked list. 10
   • (a) Construct Huffman tree and find the Huffman codes for each symbol given below with frequency of occurrence: 10
   • (b) Explain the various ways to represent graph in the memory
   • (c) Construct binary search tree from given traversal sequences: 5
3. Q5 (a) Apply linear probing to hash the following values in a hash table of size 11 and find the number of collisions: 10 marks
   • (b) Define topological sorting. Perform topological sorting for the following 10
4. Q6 (a) Construct a B tree of order 3 by inserting the following given elements as: Show the B tree at each step of insertion 10 marks
   • (b) Write a function in C for DFS traversal of graph. Explain DFS graph traversal with suitable example 10

Read from the scan above, so a character or two may differ. The scan is the original.