BSc IT Sem III 2018 2019 2019 Data Structure Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q1 Attempt of the following: 15 marks
   • a. and explain the different asymptotic notations used in data structures
   • b. are the different ways in which data structures are classified? Explain in detail
   • c. do you mean by complexity of an algorithm? Explain its types
   • d. Write an algorithm for binary search in an array
   • e. What is sparse matrix? Explain different types of sparse matrix
   • f. Explain with the help of an example how to merge two sorted arrays
2. Q2 Attempt of the following: 15 marks
   • a. Explain the structure and types of linked list
   • b. Write the algorithm for insertion of a node at the given position and deletion at the end in linked list
   • c. Write an algorithm to copy one linked list into another linked list
   • d. Write an algorithm to insert an element at the beginning and end of circular linked list
   • e. Write and explain an algorithm for inserting at the beginning in two way linked list
   • f. Explain the different categories of header linked list
3. Q3 Attempt of the following: 15 marks
   • a. Write the algorithm for push and pop operation of the stack
   • b. the algorithm for converting infix to postfix and convert the following expression to postfix notation using stack
   • c. Write the algorithm for evaluating a postfix expression using stack and give an
   • d. insertion and deletion operations take place in a queue?
   • e. Explain how queue can be represented using linked list and give the algorithm for insertion in it
   • f. priority queues are represented in memory Attempt any three of the following: 15
   • a. Write an algorithm to find the minimum and maximum element in binary search tree
   • b. — Create for the givenelements 15 7 10 2 20 15 18
   • c. a binary tree from its inorder and postorder traversals
   • d. Sort the following elements using selection sort
   • e. Write and explain the algorithm for finding a position of a given element and its parent in a binary search tree
   • f. Write the algorithm for inserting in a node in Red-Black tree
4. Q5 Attempt of the following: 15 marks
   • a. What are the different ways to represent graphs in memory? Explain
   • b. and explain the algorithm for best first search in a graph
   • c. Using Prim's algorithm find the minimum spanning tree
   • d. Define the following terms
5. Q1 Graph
6. Q2 Weighted graph
7. Q3 Multi graph
8. Q4 Directed graph
9. Q5 Hamiltonian path
   • e. Explain any two collision resolution techniques
   • f. are hash table and hash functions? Explain folding method and mid square method for constructing hash functions

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