Time Left - 15:00 mins
Indexing Formula I Starter Quiz-2
Attempt now to get your rank among 46 students!
Question 1
The index consists of:
Question 2
In a B tree file organization of order n, the highest number of keys that can be placed in a leaf node is?
Question 3
In dense Index:
Question 4
Which of the following is an unordered data file:
Question 5
In a B+ tree, if the search key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then maximum order of the B+ tree is _____.
Question 6
In a database file, the search key field is 9 bytes long, the block size is 512 bytes, a record pointer is 6 bytes and the block pointer is 7 bytes. Find the largest possible order of a non-leaf node in B+ tree implementing this file structure ?{order defines maximum number of keys present}
Question 7
Which of the following is true:
S1: It is a dense index on an unordered data file.
S2: In secondary indexing, to reduce the size of mapping, another level of indexing is
introduced.
S1: It is a dense index on an unordered data file.
S2: In secondary indexing, to reduce the size of mapping, another level of indexing is
introduced.
- 46 attempts
- 0 upvotes
- 2 comments
Tags :
GATE & PSU CSGeneralJun 23GATE & PSU CS