Indexing(B/B+ Tree) GATE CS PYQ Quiz

Last Updated :
Discuss
Comments

Question 1

Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 bytes and the size of tree/disk pointer is 8 bytes. Assume that the database has one million records. Also assume that no node of the B+ tree and no records are present initially in main memory. Consider that each record fits into one disk block.

The minimum number of disk accesses required to retrieve any record in the database is ___________ .



Note - This question was Numerical Type.

  • 4

  • 6

  • 8

  • 7

Question 2

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?

  • 1

  • 2

  • 3

  • 4

Question 3

The following key values are inserted into a B+ tree in which the order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf nodes is the maximum number of data items stored in them. The B+ tree is initially empty. 10, 3, 6, 8, 4, 2, 1. The maximum number of times leaf nodes would get split up as a result of these insertions is

  • 2

  • 3

  • 4

  • 5

Question 4

A clustering index is defined on the fields which are of type

  • non-key and ordering

  • non-key and non-ordering

  • key and ordering

  • key and non-ordering

Question 5

Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size 1024 bytes, and the size of a block pointer is 10 bytes. If the secondary index is built on the key field of the file, and a multi-level index scheme is used to store the secondary index, the number of first-level and second-level blocks in the multi-level index are respectively.

  • 8 and 0

  • 128 and 6

  • 256 and 4

  • 512 and 5

Question 6

Which one of the following is a key factor for preferring B+ -trees to binary search trees for indexing database relations?

  • Database relations have a large number of records

  • Database relations are sorted on the primary key

  • B+ -trees require less memory than binary search trees

  • Data transfer from disks is in blocks

Question 7

B+ trees are preferred to binary trees in databases because

  • Disk capacities are greater than memory capacities

  • Disk access is much slower than memory access

  • Disk data transfer rates are much less than memory data transfer rates

  • Disks are more reliable than memory

Question 8

In a B+ tree, if the search-key value is 8 bytes long, the block size is 512 bytes and the block pointer is 2 bytes, then the maximum order of the B+ tree is ____.





Note: This question appeared as Numerical Answer Type.

  • 51

  • 52

  • 53

  • 54

Question 9

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?

  • B+ Tree is a height-balanced tree

  • Non-leaf nodes have pointers to data records

  • Key values in each node are kept in sorted order

  • Each leaf node has a pointer to the next leaf node

Question 10

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?

  • 24

  • 25

  • 26

  • 27

There are 16 questions to complete.

Take a part in the ongoing discussion