9D58101 Advanced Data Structures and Algorithms
9D58101 Advanced Data Structures and Algorithms
Time: 3 hours
Max Marks: 60
Answer any FIVE questions
All questions carry equal marks
*****
1 (a)
(b)
What is linked list? Explain the insertion and deletion of a node into a double linked list.
Write the procedure to evaluate the postfix expression. Explain with suitable example.
2 (a)
(b)
3 (a)
(b)
With the help of a suitable example, explain the insertion and deletion operations into a
binary search tree.
5 (a)
(b)
6 (a)
(b)
Write and explain the procedure to find the max and min values present in a set.
Derive the average case time complexity for quick sort.
7 (a)
(b)
8 (a)
(b)
*****