1
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
B+ Trees are considered BALANCED because
2
GATE CSE 2015 Set 1
MCQ (Single Correct Answer)
+1
-0.3
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called
3
GATE CSE 2015 Set 2
Numerical
+1
-0
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 _________
Your input ____
4
GATE CSE 2010
MCQ (Single Correct Answer)
+1
-0.3
Consider a B+- tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
Questions Asked from File Structures and Indexing (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages