Back to the 2025 paper
Similar questions
Database 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 SystemA B-tree of order 4 and of height 3 will have a maximum of ____ keys. (i) 255 (ii) 63 (iii) 127 (iv) 18820202mDatabase 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.201910mDesign & Analysis of AlgorithmsLevel order traversal of a rooted tree can be done by starting from root and performing: - (i) Depth first search - (ii) Breadth first search - (iii) Pre-order traversal - (iv) In-order traversal20232m
PreviousCompared with B-tree indexing, hashing is preferred when queries mainly involve: (i) Range searches (ii) Ordered traversal (iii) Exact match search (iv) SortingNextConsider the schedule: R1(X), R2(X), W1(X), W2(X). The schedule is: (i) View serializable only (ii) Conflict serializable (iii) Not serializable (iv) Recoverable
Student FinanceWeb Platform
Pocketly — Personal Finance for Students
Keep your hostel and college expenses under control. Track accounts, log spending in seconds, and stay within your monthly budget.