munotes®

Engineering B.E. (Computer Engineering) Sem 3 Data Structure May 2019 R16 Question Paper - Mumbai University | munotes

Data Structure Question Paper, May 2019.pdf
CMPN · 1 May 2025

Loading PDF...

Questions asked in this paper

  • (3 Figures to the right indicate full marks
  1. Q1 (a) Explain Linear and Non-Linear data structures. 5 marks
    • (b) Explain Priority Queue with example. 5
    • (c) Write a program in ‘C’ to implement Quick sort. 10
  2. Q2 (a) Write a program to implement Circular Linked List. Provide the following
    • (i) Insert a node
    • (iv) Display the list
    • (b) Explain Threaded Binary tree in detail 10
  3. Q3 (a) Explain Huffman Encoding with suitable example 10 marks
    • (b) Write a program in to check for balanced parenthesis in an expression
  4. Q4 (a) Write a program in ‘C’ to implement Queue using array. 10 marks
    • (b) Explain different cases for deletion of a node in binary search tree. Write function for each case (10) Q:5 (a) Write a program in ‘C’ to implement Stack using Linked-List Perform the following
    • (i) Push
    • (11) Pop Display the stack contents
    • (b) Explain Depth First search (DFS) Traversal with an example. Write the recursive function for DFS (10)
  5. Q6 Write Short notes on (any two) 20 marks
    • (a) Application of Linked-List —Polynomial addition
    • (c) Expression Tree
    • (d) Topological Sorting

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

Issue

Something wrong on this page? Report it and we will check it against the scan.

Quick Help

No. The full paper opens straight away, with no login and nothing to pay.

Something wrong with this paper? Report it.

Connected Papers
Engineering / B.E. (Computer Engineering) · 250 papers
Browse all →
Questions? Email contact@munotes.in
Done!
Done!