and 3 others joined a min ago.
0
626views
Data Structures And Analysis Question Paper - Dec 17 - Information Technology (Semester 3) - Mumbai University (MU)
1 Answer
0
0views
written 4.9 years ago by
teamques10
★ 64k
|
Data Structures And Analysis - Dec 17
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.
What are the application of stack?
(3 marks)
00
1.b.
What are the advantages of circular linked list?
(3 marks)
00
1.c.
Differentiate between space complexity and time complexity.
(3 marks)
00
1.d.
Explain linear and non linear data structures.
(2 marks)
00
1.e.
What is expression tree? Give example.
(3 marks)
00
1.f.
Explain asymptotic notations.
(3 marks)
00
1.g.
What is recursion? State its advantages and disadvantages.
(3 marks)
00
2.a.
Write an algorithm for converting infix to postfix expression.
(10 marks)
00
2.b.
Explain BFS and DFS algorithm with examples.
(10 marks)
00
3.a.
Write an algorithm for following operations on singly linked list.
(10 marks)
00
- Insertion
- Deletion
- Trasversal
3.b.
Write an algorithm for implementing stack using array.
(10 marks)
00
4.a.
Explain the properties of binary search tree. Construct binary search tree for following elements:
(10 marks)
00
$47,12,75,88,90,73,57,1,85,50,62$
4.b.
Explain quick sort using an example. Write algorithm for it and comment on its complexity.
(10 marks)
00
5.a.
What is collision? What are the methods to resolve collision? Explain linear probing with an example.
(10 marks)
00
5.b.
Write an algorithm for merge sort and comment on its complexity.
(10 marks)
00
6.a.
Write an algorithm for implementing queue 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.