GATE CS 2015 Set 2 — Question 32
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+1 / -0MediumB+ Tree OperationsIndexing & File OrganizationDatabases
Databases → Indexing & File Organization → B+ Tree Operations
Last updated
Question
With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query: "Get all records with a search key greater than or equal to 7 and less than 15" is ________.
Correct answer
5 to 5
Solution
To satisfy the query for keys in range :
1.Search for the starting key (7):
- Fetch Root (node with 9). , go left.
- Fetch Internal Node (node with 5). , go right.
- Fetch Leaf Node (node with 5, 7). Found 7.
- Process Leaf (5, 7). Contains 7 (match).
- Follow pointer to next leaf.
- Fetch Leaf Node (node with 9, 11). Contains 9, 11 (matches, both ).
- Follow pointer to next leaf.
- Fetch Leaf Node (node with 13, 15). Contains 13 (match). Contains 15 (stop condition, ).
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Indexing & File Organization
2026 Set 2 Q15In the context of DBMS, consider the two sets T and S given below. | T | S | |---|---| | I:…2026 Set 2 Q20Consider concurrent execution of two transactions and in a DBMS, both of which access a…2026 Set 1 Q30Let and be the attributes of a relation in a relational schema. Let…2026 Set 1 Q31In the context of relational database normalization, which of the following statements is/are true?2026 Set 2 Q42In the context of schema normalization in relational DBMS, consider a set F of functional…