Home »
MCQs »
DBMS MCQs
DBMS Heap File Organization MCQs
DBMS Heap File Organization MCQs: This section contains multiple-choice questions and answers on Heap File Organization in DBMS.
Submitted by Anushree Goswami, on April 21, 2022
1. Which of the following is the basic and simple type of organization?
- ISMA
- Sequential FO
- Heap FO
- None
Answer: C) Heap FO
Explanation:
Heap FO is the basic and simple type of organization.
Discuss this Question
2. Heap File Organization work with -
- Data Sets
- Database
- Data Blocks
- Data item
Answer: C) Data Blocks
Explanation:
Heap File Organization work with Data Blocks.
Discuss this Question
3. In Heap FO, at the ____ of the file, the record is inserted.
- Beginning
- End
- Middle
- Center
Answer: B) End
Explanation:
In heap file organization, the records are inserted at the file's end.
Discuss this Question
4. It does not require ___ records when they are inserted.
- Sorting
- Ordering
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
It does not require sorting or ordering records when they are inserted.
Discuss this Question
5. New records are stored in another block when the current block of data is ___.
- Half full
- Full
- Empty
- Half Empty
Answer: B) Full
Explanation:
New records are stored in another block when the current block of data is full.
Discuss this Question
6. Any ___ in the memory can be chosen as the new ___ to store new records; it does not need to be the next ___.
- Data item
- Database
- Data Sets
- Data Blocks
Answer: D) Data Blocks
Explanation:
Any data block in the memory can be chosen as the new data block to store new records; it does not need to be the next data block.
Discuss this Question
7. What does heap file also known as?
- Ordered file
- Unordered file
- Sequential file
- Non-sequential file
Answer: B) Unordered file
Explanation:
Heap file is also known as unordered file.
Discuss this Question
8. There is a unique identifier for every record in a file, and all files are of the ___ size.
- Same
- Different
- Variable
- Multiple
Answer: A) Same
Explanation:
There is a unique identifier for every record in a file, and all files are of the same size.
Discuss this Question
9. In a ____ file, we must traverse the data from the beginning of the file until we get the requested record if we want to search, update or delete the data.
- Sequential
- Heap
- ISMA
- None
Answer: B) Heap
Explanation:
In a heap file, we must traverse the data from the beginning of the file until we get the requested record if we want to search, update or delete the data.
Discuss this Question
10. Because there is no sorting or ordering of records, if the database is large, it will be very time-consuming to ___ records.
- Search
- Updated
- Delete
- All of the above
Answer: D) All of the above
Explanation:
Because there is no sorting or ordering of records, if the database is large, it will be very time-consuming to search, update, or delete records.
Discuss this Question
11. When we work with heap files, we must check ___ entry until we get the desired record.
- First
- Last
- Each
- None
Answer: C) Each
Explanation:
When we work with heap files, we must check each entry until we get the desired record.
Discuss this Question
12. In bulk ___, the heap file method is a very good way to organize your files.
- Updation
- Deletion
- Insertion
- None
Answer: C) Insertion
Explanation:
In bulk insertion, the heap file method is a very good way to organize your files.
Discuss this Question
13. This method is best suitable for loading ____ data sets at one time into the database.
- Small
- Large
- Few
- Little
Answer: B) Large
Explanation:
This method is best suitable for loading large data sets at one time into the database.
Discuss this Question
14. With ____ databases, it is faster to fetch and retrieve records than to retrieve sequential records.
- Large
- Small
- High
- Big
Answer: B) Small
Explanation:
With small databases, it is faster to fetch and retrieve records than to retrieve sequential records.
Discuss this Question
15. It takes a ___ time to search or modify the record with a heap file method, which is inefficient for large databases.
- Less
- Little
- Null
- Long
Answer: D) Long
Explanation:
It takes a long time to search or modify the record with this method, which is inefficient for large databases.
Discuss this Question
16. For ___ databases, the Heap file method is insufficient.
- Small
- Large
- Little
- Tiny
Answer: B) Large
Explanation:
For large databases, the heap file method is insufficient.
Discuss this Question