BSc IT Sem III 2022 2023 Oct 2023 DATA STRUCTURES Question Paper - Mumbai University | munotes

Questions asked in this paper

• 2) Figures to the right indicate full

1. Q1 Attempt any three {15]
   • a) How the data structures are classified? Explain in detail
   • b) What is Sparse matrix? Explain different types of sparse matrix Consider 3-dimensional array ‘A’ whose subscript limits are 2<=j<=3, 3<=k<=6, Assuming the base address of array is 2000 and each element of array occupies 2 memory cells. Calculate the address of element
   • d) Write an algorithm for binary search in an array Differentiate between linear search and binary search
   • f) What do you mean by complexity of an algorithm? Explain its types
2. Q2 Attempt any three 15 marks
   • a) Explain Linked List and its different types,
   • b) Write an algorithm to insert an element in linked list at the beginning Write an algorithm to add node at beginning of single linked list along with
   • d) Explain different categories of header linked list Write short note on traversing in linked list,
   • f) Explain Circular Linked List-Organization and Operation in detail
3. Q3 Attempt any threc 15 marks
   • a) Write an algorithm for push and pop operation of the Stack,
   • b) Write an algorithm to insert element in queue
   • c) Evaluate postfix expression for given expression using stack representation
   • d) Explain priority queue in detail Convert following expressions:
   • i. infix to postfix A/B+C*D li. infix to prefix (A +
   • f) What is recursion? State its properties
4. Q4 Attempt any three 15 marks
   • a) Explain the following terms regarding trees:
   • i.Root ii. Node of Level of tree
   • b) Explain preorder, inorder and postorder of following tree:
   • c) Examine the technique to produce Huffman Tree and Huffman Codes for following
   • d) Arrange the list 26,54,93,17,77,31,44,55 in ascending order by using bubble sort. Write down step by step process Binary tree T has 9 nodes. Generate the binary tree to inorder and postorder of tree
   • f) Create a heap for the given elements 25 17 10 20 22 15 28
5. Q5 Attempt any three {15]
   • a) Explain following:
   • 5) Explain following graph terminology:
   • v.Directed graph Write and Explain the algorithm for Breadth-First Search (BFS) in a graph
   • d) Using Prim's Algorithm find the minimum spanning tree Write in brief about hash function
   • f) Explain Depth First Search algorithm with implementation

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