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

Questions asked in this paper

• 2) Figures to the right indicate full marks

1. Q1 Attempt any three
   • a) Describe various operation that can be performed on data structure
   • b) What do you mean by abstract data How it is different from
   • c) Consider 2-dimensional array If the base address of D is 1500 and each element of array occupies 4 memory cells then find the address of element using row major order and column major order
   • d) Write an algorithm for sorting an array using Bubble Sort algorithm
   • e) Explain advantages and limitations of array
   • f) Explain importance of algorithm analysis
2. Q2 Attempt any three
   • a) Explain applications of Linked List
   • b) Write an algorithm to traverse One-Way Linked List
   • c) Write an algorithm to delete a node at beginning of Linked List along
   • d) Write an algorithm for splitting a Linked List into two Linked L.ist with pointer variables and respectively
   • e) Write a short note on Doubly Linked List
   • f) Explain Header Linked List and categories of it
3. Q3 Attempt any three
   • a) Write an algorithm for push and pop operation of the Stack using
   • b) Write short note on Deque
   • c) Transform the given expression I into its equivalent postfix expression
   • d) Explain the applications of Stack in detail 5 e) Convert following expressions:
   • i. infix to prefix li. infix to postfix (x*y)+(z+((a+b-c)*d))
   • f) Explain the applications of i) Priority Queue Queue
4. Q4 Attempt any three
   • a) Explain the following terms regarding Binary Tree:
   • b) Consider the Binary Search Tree T given below. Dr iw the separate Binary Search Tree for each operation after performing it given below:
   • i) Add an element 10 into T
   • ii) Add an element 44 into T
   • iii) Delete an element 35 from T
   • iv) Delete an element 40 trom T
   • v) Delete an element 45 from T
   • c) Examine the technique to produce Huffman Tree and Huffman Codes for the given text- ACAEBCABEABADFCBD
   • d) Write an algorithm to traverse Binary tree recursively in
   • i) Preorder manner
   • e) Reconstruct the Binary Tree T having 10 nodes according to Inorder and Postorder of tree
   • f) Draw the Max Heap with following elements
5. Q5 Attempt any three 13 marks
   • a) Explain Adjacency List representation of graph
   • b) Explain following graph
   • i.Hamiltonian path
   • v.Directed graph
   • c). Explain the following hashing:
   • d) Using Dijkstra Algorithm find the shortest distance of all the nodes from source node using following tree:
   • e) Write algorithm for finding the path matrix for graph
   • f) Write short on hash function

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