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

Data Structures And Analysis - Dec 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. Explain linear and non linear data structures.
(2 marks) 00

1.b. Define a graph. List types of graph with examples.
(3 marks) 00

1.c. What is expression tree? Give example.
(3 marks) 00

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

1.e. Define double ended queue. List the variants of double ended queue.
(3 marks) 00

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

1.g. What is linked list? State the advantages of linked list.
(3 marks) 00

2.a. Write an algorithm for merge sort and comment on its complexity.
(10 marks) 00

2.b. Write an algorithm for implementing stack using array.
(10 marks) 00

3.a. Define binary tree. Find in-order, pre-order and post-order of following binary tree.

enter image description here

(10 marks) 00

3.b. Write an algorithm for implementing queue using array.
(10 marks) 00

4.a. Explain quick sort using an example. Write algorithm for it and comment on its complexity.
(10 marks) 00

4.b. What is collision? What are the methods to resolve collision? Explain linear probing with an example.
(10 marks) 00

5.a. Write an algorithm for converting infix to postfix expression.
(10 marks) 00

5.b. Define binary search tree. Write an algorithm for following operations on binary search tree.

  1. Insertion
  2. Deletion

(10 marks) 00

6.a. Write an algorithm for following operations on doubly linked list.

  1. Insertion
  2. Deletion
  3. Traversal

(10 marks) 00

6.b. What is minimum spanning tree? Draw the MST using kruskal's and prim's algorithm and find out the cost with all intermediate steps.

enter image description here

(10 marks) 00

Please log in to add an answer.