Time Left - 15:00 mins

GATE 2023 Databases Rank Booster Quiz 41

Attempt now to get your rank among 69 students!

Question 1

Suppose that we have an ordered file with one million records, stored on a disk. The block size is 2048B, Records are of fixed size and are unspanned. Record length is 256B.,then what is the number of blocks required for data file?

Question 2

Consider a B tree with keys (2,5,10,1,6,9,4,3,12,18,20,25). After constructing B tree with given keys number of elements at level 2 will be (if root is at level 1). The order of tree is 4.

Question 3

Statement I: A B+ tree with ‘k’ levels can store more entries in its internal nodes compared to a B-tree having the same ‘k’ levels.

Statement II: Search Time in B-Tree is less than search time in B⁺ Tree.

Which of the following statements are correct with respect to the given statements?

Question 4

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

Question 5

Consider a B-tree with key size of 8 bytes, block size of 512 bytes, data pointer of 6 bytes and block pointer of 5 bytes. The order of the 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

In a B tree file organization of order n, the highest number of keys that can be placed in a leaf node is?

69 attempts
0 upvotes
0 comments

Tags :

GATE & PSU CS Databases

Jan 23GATE & PSU CS