Author:
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 in the dense index?
(A) n/3
(B) n/30
(C) n/10
(D) 13n/30
The directory can be viewed as __ that translates filenames into their directory entries?
(A) Swap space
(B) Cache
(C) Partition
(D) Symbol Table
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on?
(A) The size of the blocks, the size of the address of the blocks
(B) The number of blocks used for index, and the size of the index blocks
(C) The size of the blocks, the number of blocks used for the index, and the size of the address of the blocks
(D) None of the above
Index consists of?
(A) Pointer to the matter list
(B) Keys
(C) Both A & B
(D) None of the above
In a hierarchical data a hashing function is used to locate the?
(A) Records
(B) Foreign key
(C) Root
(D) Collision
Which among following is dense index?
(A) Secondary index
(B) Clusters index
(C) Primary index
(D) None of the above
Physical location of a record determined by a formula that transforms a file key into a record location is?
(A) Indexed file
(B) B-Tree file
(C) Sequential file
(D) Hashed file