Identify the advantage and disadvantage of heap file organization.For loading huge amount of data at a time, heap file is best because we can place any record in any block.Fetching of record is easy for smaller database.Difficult to retrieve a record from large databse.

Identify the advantage and disadvantage of sequential file organization.Fetching particular data must follow only sequential order.Time consuming.Retrieval of data is easy.Simple designCheaper storage mechanism.

The heap data structure is the most efficient way of implementing the ..................a)Priority queueb)None of the mentionedc)Front queued)Back queue

ist any four disadvantages of file system approach over database approach.

Operations of Heap Data Structure:

Retrieval operation is fastest in which data structure a) Heapb) Stack c) Linked list d) None