Download Mumbai University (MU) MCA 2019 May 2nd Sem 54701 Data Structures Question Paper

Code: 54701 / Data Structures

Firstranker's choice FirstRanker.com

[Total Marks: 100]

--- Content provided by‌ FirstRanker.com ---

(3 Hours)

N.B.: 1) Question No.1 is compulsory.

2) Attempt any four from the remaining questions.

1. (a) Write an algorithm for the following (10)
   1. Insert a node in sorted Linked List
   2. Delete first node from the Linked List.

   --- Content provided by‍ FirstRanker.com ---

2. (b) What is a stack? Give algorithm to push and pop element in stack. List the (10) applications of stack.
3. (a) Inorder and post order traversal of a binary tree are as follows (10)

   Preorder ABDG CEHIF

   Inorder DGBAHEICF

   Show a step wise reconstruction of the binary tree

   --- Content provided by​ FirstRanker.com ---

4. (b) For circular queue write algorithms to (10)
   1. Insert an element in the queue
   2. Search for an element in the queue
5. (a) Write Short notes on (10)
   1. Analysis of Algorithm

   --- Content provided by⁠ FirstRanker.com ---

   2. Priority Queue
6. (b) Consider the following list of numbers: 67, 12, 89, 26, 38, 45, 22, 79, 53, 9, 61 (10)

   Sort these numbers using heap sort

7. (a) What is minimum spanning-tree? Write Kruskal’s algorithm to find minimum (10) spanning tree and determine minimum spanning tree of the following graph

--- Content provided by​ FirstRanker.com ---

8. (b) Explain Graph and its terminology also explains in brief adjacency matrix and (10) adjacency list for Graph Storage.
9. (a) What is Huffman Coding? Given the set of symbols and corresponding (10) frequency table as below, explain the steps to find Huffman Code
   

   Symbol	Frequency
   A	20
   B	10
   C	10
   D	30
   E	30

10. (b) Hash the following in a table of size 11. Use linear probing and quadratic (10) probing collision resolution techniques:

    23,55, 10, 71, 67, 32, 100, 18, 10, 90, 44.

--- Content provided by⁠ FirstRanker.com ---

11. (a) Define B-tree. Construct B-tree of order 4 with following data (10)

    5,3,21,9,1,13,2,7,10, 12,4, 8

12. (b) Write a short note on (10)
    1. Binary Search Tree
    2. Doubly linked list

--- Content provided by‌ FirstRanker.com ---

13. (a) What is AVL tree? Construct AVL tree for the following data. Mention the type (10) of rotation for each case. 50, 25, 10, 5, 7, 3, 30, 20, 8, 15
14. (b) Give BFS and DFS traversal of the following graph (10)