0
419views
Data Structures And Analysis Question Paper - May 18 - Information Technology (Semester 3) - Mumbai University (MU)
1 Answer
0
0views

Data Structures And Analysis - May 18

Information Technology (Semester 3)

Total marks: 80
Total time: 3 Hours
INSTRUCTIONS
(1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Draw neat diagrams wherever necessary.

1.a. Define stack. Give its applications?
(2 marks) 00

1.b. What are the different linear and non-linear data structures?
(3marks) 00

1.c. What is a linked list? Explain its types.
(3 marks) 00

1.d. Define asymptotic notation with an example.
(3 marks) 00

1.e. What is recursion? State its advantages and disadvantages.
(3 marks) 00

1.f. Define minimum spanning tree. List the techniques to compute minimum spanning tree.
(3 marks) 00

1.g. Define expression tree with example.
(3 marks) 00

2.a. Write an algorithm to create doubly linked list and display the list?
(10 marks) 00

2.b. Write an algorithm to implement queue using array?
(10 marks) 00

3.a. Write an algorithm to convert INFIX to POSTFIX expression?
(10 marks) 00

3.b. Write the algorithm for merge sort. Comment on its complexity?
(10 marks) 00

4.a. Write an algorithm to implement priority queue?
(10 marks) 00

4.b. Explain BFS and DFS algorithm with examples?
(10 marks) 00

5.a. Define binary search tree. Explain the different operations on a binary search tree with example.
(5 marks) 00

5.b. What is minimum spanning tree? Explain Kruskal's algorithm with an example.
(10 marks) 00

Write short notes on any four.

6.a. Selection sort.
(5 marks) 00

6.b. Prim's algorithm.
(5 marks) 00

6.c. Binary search.
(5 marks) 00

6.d. Hashing techniques.
(5 marks) 00

6.e. Dijkstra's algorithm.
(5 marks) 00

Please log in to add an answer.