Back to the 2024 paper
Similar questions
Design & Analysis of AlgorithmsA priority queue is implemented as a Max-heap. Initially it has 5 elements. The level order traversal of the heap is 10, 8, 5, 3, 2. Two new elements '1' and '7' are inserted into the heap in that order. The level order traversal of the heap after the insertion of the elements is: - (i) 10, 8, 7, 5, 3, 2, 1 - (ii) 10, 8, 7, 2, 3, 1, 5 - (iii) 10, 8, 7, 1, 2, 3, 5 - (iv) 10, 8, 7, 3, 2, 1, 520222mDatabase Management SystemFor the following set of key values construct a B+ tree with a degree 4: 5, 10, 15, 29, 35, 46, 58, 63, 67, 89 Initially tree is empty. Values must be added in ascending order. Show the step-by-step construction.201910mDatabase Management SystemConstruct the B+ tree for the following set of key values: (2, 3, 5, 7, 11, 17, 19, 23, 29, 31) Assume that tree is initially empty and values are added in ascending order. Construct B+ tree for the cases where the number of pointers that will fit in one node is as follows: (a) Four (b) Six (c) Eight202014mDatabase Management SystemConsider a hash table of size 10 with the hash function h(k) = k \pmod{10}. Insert the keys 23, 43, 13, 27, 37, and 50 into the hash table. Construct the hash table using separate chaining for collision resolution and then reconstruct it using linear probing. Compare the final arrangements obtained using both methods.20257m
PreviousSimulate Quick sort algorithm for the following example 25, 36, 12, 4, 5, 16, 58, 54, 24, 16, 9, 65, 78NextExplain Strassen's matrix multiplication and its time complexity.
Official AppAndroid App
PYQDeck for Android
Solve BEU previous-year exam papers anywhere, anytime. Fast search, offline paper viewing, and step-by-step solutions designed specifically for your phone.