1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
The following key values are inserted into a B+-tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf nodes is the maximum number of data items that can be stored in it. The B+- tree is initially empty.

10, 3, 6, 8, 4, 2, 1

The maximum number of times leaf nodes would get split up as a result of these insertions is
A
2
B
3
C
4
D
5
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multi-level index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multi-level index are respectively
A
8 and 0
B
128 and 6
C
256 and 4
D
512 and 5
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links. GATE CSE 2007 Database Management System - File Structures and Indexing Question 8 English 1

Now the key K 50 is deleted from the B+ tree resulting after the two insertions made earlier. Consider the following statements about the B+ tree resulting after this deletion.

i) The height of the tree remains the same.

ii) The node GATE CSE 2007 Database Management System - File Structures and Indexing Question 8 English 2 (disregarding the links) is present in the tree.

iii) The root node remains unchanged (disregarding the links).

Which one of the following options is true ?
A
Statements (i) and (ii) are true
B
Statements (ii) and (iii) are true
C
Statements (iii) and (i) are true
D
All the statements are false
4
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links. GATE CSE 2007 Database Management System - File Structures and Indexing Question 9 English 1

Keys K 15 and then K 25 are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions?

GATE CSE 2007 Database Management System - File Structures and Indexing Question 9 English 2
A
1
B
2
C
3
D
4
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12