GATE CS 2025 (Afternoon) — Question 57

Database Management Systems (DBMS)File Organization & Indexing (e.g., B and B+ Trees)NAT2 marksHard

In a B+ - tree where each node can hold at most four key values, a root to leaf path consists of the following nodes: A = (49, 77, 83, –), B = (7, 19, 33, 44), C = (20, 22, 25, 26) The *-marked keys signify that these are data entries in a leaf. Assume that a pointer between keys \( k_1 \) and \( k_2 \) points to a subtree containing keys in \( [k_1, k_2) \), and that when a leaf is created, the smallest key in it is copied up into its parent. A record with key value 23 is inserted into the B+ - tree. The smallest key value in the parent of the leaf that contains 25* is ________. (Answer in integer)
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on File Organization & Indexing (e.g., B and B+ Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group