GATE CS 2025 (Forenoon) — Question 21

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

Consider the following \( B^+ \) tree with 5 nodes, in which a node can store at most 3 key values. The value 23 is now inserted in the \( B^+ \) tree. Which of the following options(s) is/are CORRECT?
Question image
  1. A
    None of the nodes will split.
  2. B
    At least one node will split and redistribute.
  3. C
    The total number of nodes will remain same.
  4. D
    The height of the tree will increase.
Practise the full 2025-FN 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