and 3 others joined a min ago.
0
549views
Data Structures And Analysis Question Paper - Jun 19 - Information Technology (Semester 3) - Mumbai University (MU)
1 Answer
0
1views
written 4.8 years ago by
rutujakhilari12345
• 40
|
Data Structures And Analysis - Jun 19
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.
Translate the given infix expression in to equivalent postfix expression.
(a+ bc-d)/(ef)
(3 marks)
00
1.b.
Explain linear and non linear data structures.
(3 marks)
00
1.c.
What is depth, height and degree of Binary tree.
(3 marks)
00
1.d.
What are the different ways to represent a graph?
(2 marks)
00
1.e.
What is linked list? Explain types of linked list.
(3 marks)
00
1.f.
What is recursion? State its advantages and disadvantages.
(3 marks)
00
1.g.
Explain asymptotic notations.
(3 marks)
00
2.a.
Write an algorithm for implementing queue using array.
(10 marks)
00
2.b.
Write an algorithm for merge sort and comment on its complexity.
(10 marks)
00
3.a.
Explain BFS and DFS algorithm with examples.
(10 marks)
00
3.b.
Traverse the following binary tree into preorder, inorder, postorder by giving its algorithm.
(10 marks)
00
4.a.
What is Doubly Linked List? Write an algorithm to implement following operations on Doubly linked List.
(10 marks)
00
(1)Insertion(All cases)
(2)Traversal(Forward and Backward)
4.b.
What is collision? What are the methods to resolve collision? Explain Linear probing with an example.
(10 marks)
00
5.a.
What is Binary search tree. Construct Binary search tree for following elements:
13, 3, 4, 12, 14, 10, 5, 1, 8, 2, 7, 9, 11, 6, 18
(10 marks)
00
5.b.
Explain Heap sort using an example. Write algorithm for it and comment on its complexity.
(10 marks)
00
6.a.
Write an algorithm for implementing stack using array.
(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.
(10 marks)
00
ADD COMMENT
EDIT
Please log in to add an answer.