Engineering BE Computer Engineering Sem 3 December 2019 2019 Data Structures Question Paper - Mumbai University | munotes

Questions asked in this paper

• (4) Figures to the right indicate full marks

1. Q1 (a) Explain ADT with an example. 5 marks
   • (b) Differentiate between Static and Dynamic representation of Data Structure 5
   • (c) Write a ‘C’ program to implement Binary Search using recursion 5
   • (d) Discuss practical applications of Queues 5
2. Q2 (a) Write a ‘C’ program to implement STACK using arrays 10 marks
   • (b)What are the different methods of File I/O in language? What library functions are supported by language to do this? (10)
3. Q2 (a) What are the advantages of Linked- list over array? Write a program to
   • (b) Explain indexed Sequential search with a suitable example. What are the advantages and disadvantages of Indexed Sequential search (10)
4. Q3 (a) Write a ‘C program to create a “Singly Linked List”. The ADT should support the following operations (10)
   • (iv) Displaying the list
   • (b)Explain the method of Huffman Encoding. Apply Huffman encoding method for the Sentence “MAHARASHTRA”. Give Huffman code for each symbol. (10)
5. Q5 (a) Write a program to create Binary Search Tree. Show BST for the following input:
   • (b)What is the use of hashing? Show hash table entries for the given dataset using Linear Probing and Quadratic Probing: 12,45 (10)
6. Q6 Write Short notes on (any two) 20 marks
   • (b) BFS Traversal

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