Time Left - 15:00 mins
GATE 2023 Database Quiz 21
Attempt now to get your rank among 60 students!
Question 1
Consider a B+ tree in which maximum number of keys in a node is 8. What is minimum number of keys present in a non leaf node?
Question 2
Consider the following statements for B+ Tree:
S1: All leaf nodes are at the same level.
S2: Every leaf node contains a pointer to its next node if it is present.
Which of the following is true?
Question 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?
Question 4
A clustering index is defined on the fields which are of type?
Question 5
Which of the following is true:
S1: Primary index is a dense index.
S2: In Sparse Index Files, the set of records of Database file there exist one index entry.
S1: Primary index is a dense index.
S2: In Sparse Index Files, the set of records of Database file there exist one index entry.
Question 6
If we are accessing a block index using binary search, how many block reads are required to access the data from the file using single-level index if the number of blocks is 100?
- 60 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSGeneralSep 12GATE & PSU CS
