1
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 13 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 13 English 2
A
1
B
2
C
3
D
4
2
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 12 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 12 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
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?
A
24
B
25
C
26
D
27
4
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on K, where p denotes the maximum number of tree pointers in a B-tree index node. Assume that K is 10 bytes long; disk block size is 512 bytes; each data pointer PD is 8 bytes long and each block pointer PB is 5 bytes long. In order for each B-tree node to fit in a single disk block, the maximum value of p is
A
20
B
22
C
23
D
32
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12