File structures (sequential files, indexing, B and B+ trees)

Question 11

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 12

If following sequence of keys are inserted in a B⁺ tree with K(=3) pointers: 8, 5, 1, 7, 3, 12, 9, 6 Which of the following shall be correct B+ tree? (1) (2) (3) (4)

• (1)
• (2)
• (3)
• (4)

Question 13

Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index

• 13n/30
• n/3
• n/10
• n/30

Question 14

Calculate the order of leaf(p_leaf) and non leaf(p) nodes of a B+ tree based on the information given below Search key field = 12 bytes Record pointer = 10 bytes Block pointer = 8 bytes Block size = 1 KB

• p_leaf = 51 & p = 46
• p_leaf= 47 & p = 52
• p_leaf= 46 & p = 50
• p_leaf = 52 & p = 47

Question 15

The physical location of a record determined by a formula that transforms a file key into a record location is

• Hashed file
• B-Tree file
• Indexed file
• Sequential file

Question 16

Embedded pointer provides

• a secondary access path
• a physical record key
• an inverted index
• a prime key

Question 17

Embedded pointer provides

• A secondary access path
• A physical record key
• An inverted index
• A primary key

Question 18

Raid configurations of the disks are used to provide

• Fault-tolerance

• High speed

• High data density

• A & B

Question 19

In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:

• The number of blocks used for index and the size of index
• Size of Blocks and size of Address
• Size of index
• Size of Block

Question 20

In __________ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.

• Index
• Linked
• Contiguous
• Bit Map