1
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 _________ GATE CSE 2015 Set 2 Database Management System - File Structures and Indexing Question 20 English
Your input ____
2
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?
A
1
B
2
C
3
D
4
3
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
A clustering index is defined on the fields which are of type
A
non-key and ordering
B
non-key and non-ordering
C
key and ordering
D
key and non-ordering
4
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are:
A
5
B
4
C
3
D
2
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP