adplus-dvertising
frame-decoration

Question

The kind of allocation in which the file blocks contain the pointer to the next blocks of file is classified as

a.

linked allocation

b.

indexed allocation

c.

header allocation

d.

contiguous allocation

Posted under Indexing and Hashing DBMS

Answer: (a).linked allocation

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The kind of allocation in which the file blocks contain the pointer to the next blocks of file is classified as

Similar Questions

Discover Related MCQs

Q. The hashing technique which allocates fixed number of buckets is classified as

Q. The hashing technique which allows increase or decrease in number of buckets without a need of directory is classified as

Q. In linear hashing, the formula used to calculate number of records if the blocking factor, loading factor and file buckets are known is as

Q. The type of data organization which does not allow cross block boundaries is called

Q. If the global depth is more than local depth then the operation must be performed in directory array is

Q. In extendible hashing array of bucket addresses 2d then d is considered as

Q. The open addressing, multiple hashing and chaining are all the methods used for

Q. The record searching technique which is based on the blocks rather than records is called

Q. The additional access path added into ordered file is called

Q. The hash functions that does not maintain order of values of hash field are called

Q. The kind of hashing technique in which a directory of having addresses 2d is maintained is called

Q. The type of organization in which the records are inserted at the end of stored file is classified as

Q. The kind of field with which the record searching is done is classified as

Q. The hashing process if used for disk files is classified as

Q. The fields which are used to retrieve the related records from other files are called

Q. The command in DBMS software which is used to locate records that fulfills the search condition is classified as

Q. The number of values taken by hash field are called

Q. The index which has an entry for some of the key value is classified as

Q. The primary indexes, secondary indexes and cluster indexes are all types of

Q. In multilevel indexes, the primary index created for its first level is classified as