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

Questions asked in this paper

1. Q1 Attempt any three of the following: 15 marks
   • a. Whatis an Algorithm? Explain properties of.an algorithm
   • b. Write an algorithm for searching the element array
   • c. What is data structure? Explain primitive and non-primitive data structure
   • d. What is time and space complexity? Explain Big O and Big Theta notation
   • e. Write an algorithm for sorting the elements of an array
   • f. Write an algorithm for merging two arrays
2. Q2 Attempt any three of the following: 15 marks
   • a. Explain the structure of single linked list
   • b. Explain algorithmically the traversal of single linked list
   • c. Write an algorithm for reversing the single linked list
   • d. Explain the structure of double linked list
   • e. Explain in brief the working mechanism of circular linked list
   • f. Explain how polynomials are presented using linked list
3. Q3 Attempt any three of the following: What is stack? Write an algorithm for PUSH operation 15 marks
   • b. the steps for converting infix to postfix. And Convert the following expression into
   • c. _ Explain the working mechanism of Circular queue
   • d. Write an algorithm for Deque
   • e. Explain the concept of recursion with suitable example What is Queue? Explain the operations of queue with suitable example
4. Q4 Attempt any three of the following: 15 marks
   • a. Write an.algorithm for Bubble sort Explain the difference between binary search and sequential search
   • c. What is heap? Explain the concept of minimum heap
   • d. Sort the following elements using Insertion sort
   • Q. P. Code: 20937
   • e. What is binary tree? Construct the binary tree for the following: 21,18,7,9,11,8,19,14,13,6
   • f. Explain inorder and preorder traversal of the tree Attempt any three of the following: 15
   • a. Hashing? Explain Linear Probing with suitable example
   • b. What is collision? Explain how it is resolve
   • c. What is Graph? Explain directed and undirected graph
   • d. Explain in brief about spanning tree with suitable example
   • e. Give the outline of Kruskal’s algorithm
   • f. What is Adjacency Matrix? Generate adjacency matrix for the following undirected

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