STUPIDSID
Solve any one question from Q.1(a,b) &Q.2(a,b)
1(a)
Write a non-recursive pseudo for post order traversal of binary tree.
5 M
1(b)
Consider the given graph and find the shortest path by using Dijkstra's algorithm from 'a' to 'g'.
!mage
!mage
7 M
2(a)
Construct a binary tree from given two traversals:
Inorder Traversal - 1 2 3 14 7 10 11 40 30
Postorder Traversal - 1 3 2 7 10 40 30 11 14
Inorder Traversal - 1 2 3 14 7 10 11 40 30
Postorder Traversal - 1 3 2 7 10 40 30 11 14
6 M
2(b)
Write a short note on topological sorting.
6 M
Solve any one question from Q.3(a,b) & Q.4(a,b)
3(a)
Write short note on skip list.
6 M
3(b)
Build the AVL tree for the following data. Show the step by step construction 25, 12, 17, 30, 15, 14, 37, 27, 40 29, 28
6 M
4(a)
Write functions for LL and LR rotations with respect to AVL tree.
6 M
4(b)
Construct has table of size 10 using linear probing with replacement stratgey for collision resolution. The hash function is h (x) =x% 10. Calculate total numbers of comparisons requirede for searching. Consider slot per bucket is 1 25, 3, 21, 13, 1, 2, 7, 12, 4, 8
6 M
Solve any one question from Q.5(a,b) & Q.6(a,b)
5(a)
Construct a B tree of order 3 for the following data:
50, 30, 21, 90, 10, 13, 20, 70, 25, 92, 80
50, 30, 21, 90, 10, 13, 20, 70, 25, 92, 80
7 M
5(b)
What is max heap? Write a function to insert an element in max heap. What is the time complexity of inserting an element in Max heap?
7 M
6(a)
Write an algorithm to delete a node from B-tree.
7 M
6(b)
Create min heap of given data 10, 20, 15, 12, 25, 30, 14, 2, 5, 4. After creation of min heap perform one delete operation on it and show the final min heap.
7 M
Solve any one question from Q.7(a,b) &Q.8(a,b)
7(a)
Explain seqential file, Random access file organization.
6 M
7(b)
Explain linked organisation with respect to file handling.
6 M
8(a)
Explain any three operations on sequential file organization with example.
6 M
8(b)
Write a short note on external sort.
6 M
More question papers from Advanced Data Structure