1
GATE CSE 2019
MCQ (Single Correct Answer)
+1
-0.33
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?
A
B+ tree is a height-balanced tree
B
Non-leaf nodes have pointers to data records
C
Each leaf node has a pointer to the next leaf node
D
Key values in each node are kept in sorted order
2
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+1
-0.3
B+ Trees are considered BALANCED because
A
the lengths of the paths from the root to all leaf nodes are all equal.
B
the lengths of the paths from the root to all leaf nodes differ from each other by at most 1.
C
the number of children of any two non-leaf sibling nodes differ by at most 1.
D
the number of records in any two leaf nodes differ by at most 1.
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 _________ GATE CSE 2015 Set 2 Database Management System - File Structures and Indexing Question 15 English
Your input ____
4
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
A
Dense
B
Sparse
C
Clustered
D
Unclustered
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