STUPIDSID
Solve any one question from Q.1(a,b) &Q.2(a,b)
1(a)
Clearly indicate the content of stack for evaluating the following postfix expression.
Assume A = 10, B = 2, C=13 :
i) AB + C - BA -C + -
ii) ABC + *CBA - + *
Assume A = 10, B = 2, C=13 :
i) AB + C - BA -C + -
ii) ABC + *CBA - + *
6 M
1(b)
Construct a binary tree from the given traversals:
postorder: HIDEBFGCA
inorder: HDIBEAFCG.
postorder: HIDEBFGCA
inorder: HDIBEAFCG.
6 M
2(a)
Explain the concept of Multiqueue and double ended queue with example.
6 M
2(b)
Write a pseudo code for kruskals algorithm.
6 M
Solve any one question from Q.3(a,b) &Q.4(a,b)
3(a)
What are the characteristics of good hash function? List out different techniques to resolve collision in hash table.Explain Linear probing with and without replacement suitable example.
8 M
3(b)
Define binary search tree. Draw the BST for given nodes:
38, 14, 56, 23, 82, 8, 45, 70, 18 15.
38, 14, 56, 23, 82, 8, 45, 70, 18 15.
4 M
4(a)
For the following graph find the DFSand BFS using suiatble data structure.
!mage
!mage
4 M
4(b)
Sort the following number using heap sort and show the sortig steapwis: 44, 66, 33, 88, 77, 55, 22.
8 M
Solve any one question from Q.5(a,b) &Q.6(a,b)
5(a)
What is threaded binary tree explain with example.
6 M
5(b)
What is B-tree? Explain the following operation on B-tree:
i) Inserting into B-tree
ii) Deletion fromm B-tree.
i) Inserting into B-tree
ii) Deletion fromm B-tree.
8 M
6(a)
Obtain and AVL tree by inserting one data element at a time in the following sequence:
50, 55, 60, 15, 10, 40, 20, 45, 30, 70, 80.
50, 55, 60, 15, 10, 40, 20, 45, 30, 70, 80.
8 M
6(b)
Write short notes on:
i) Red black on:
i) Red black tress
ii) Splay tress.
i) Red black on:
i) Red black tress
ii) Splay tress.
6 M
Solve any one question from Q.7(a,b) &Q.8(a,b)
7(a)
Explain various file opening modes with respect to text and binary files.
6 M
7(b)
What are the primitive operations on sequential file? Explain with example.
6 M
8(a)
Compare the feature of sequential file, index sequential file and direct access file.
6 M
8(b)
Write C++ perform the following operations on direct access file:
i) Create & display records
ii) Insert record.
i) Create & display records
ii) Insert record.
6 M
More question papers from Data Structures & Files