Home »
MCQs »
DBMS MCQs
DBMS Dynamic Hashing MCQs
DBMS Dynamic Hashing MCQs: This section contains multiple-choice questions and answers on Dynamic Hashing in DBMS.
Submitted by Anushree Goswami, on April 23, 2022
1. Static hashing has problems such as bucket overflows, which can be overcome by __ hashing.
- Simple
- Dynamic
- Overflow
- None
Answer: B) Dynamic
Explanation:
Static hashing has problems such as bucket overflows, which can be overcome by dynamic hashing.
Discuss this Question
2. According to this method, data buckets expand or contract as the number of records increases or decreases.
- Increases
- Decreases
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
According to this method, data buckets expand or contract as the number of records increases or decreases.
Discuss this Question
3. What is Dynamic Hashing also known as?
- Extendable Hashing Method
- Extra Hashing Method
- Extendable Dynamic Method
- Extra Dynamic Method
Answer: A) Extendable Hashing Method
Explanation:
Dynamic Hashing is also known as Extendable Hashing Method.
Discuss this Question
4. Hashing is dynamic with this method, i.e., it allows for insertions or deletions without affecting performance.
- Insertions
- Deletions
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
Hashing is dynamic with this method, i.e., it allows for insertions or deletions without affecting performance.
Discuss this Question
5. Which of the following comes in the steps of search a key?
- Using the key's hash address, calculate the address.
- In the directory, i refers to the number of bits used.
- Take the i bits of the hash address that are the least significant.
- All of the above
Answer: D) All of the above
Explanation:
The steps that come in the search of a key -
- Using the key's hash address, calculate the address.
- In the directory, i refers to the number of bits used.
- Take the i bits of the hash address that are the least significant.
Discuss this Question
6. Which of the following comes in the steps of insert a new record?
- The retrieval procedure is the different, you should end up in some bucket.
- Place the record in that bucket if there is nol space.
- The bucket will be split if it is full, and records will be redistributed.
- All of the above
Answer: C) The bucket will be split if it is full, and records will be redistributed
Explanation:
The bucket will be split if it is full, and records will be redistributed.
Discuss this Question
7. Data growth in the system does not affect ____ with this method.
- Database
- System
- Performance
- Memory
Answer: C) Performance
Explanation:
Data growth in the system does not affect performance with this method.
Discuss this Question
8. By increasing the memory ___, the data can be accommodated.
- Lane
- Size
- Data
- None
Answer: B) Size
Explanation:
By increasing the memory size, the data can be accommodated.
Discuss this Question
9. Since memory grows and shrinks with the data, this method makes the ____ of memory.
- Least
- Average
- Most
- None
Answer: C) Most
Explanation:
Since memory grows and shrinks with the data, this method makes the most of memory.
Discuss this Question
10. By using this method, ____ memory will be left over.
- Unused
- No unused
- Used
- No Used
Answer: B) No unused
Explanation:
By using this method, no unused memory will be left over.
Discuss this Question
11. Data in dynamic databases that grow and shrink frequently benefit from this method.
- Static
- Dynamic
- Hash
- None
Answer: B) Dynamic
Explanation:
Data in dynamic databases that grow and shrink frequently benefit from this method.
Discuss this Question
12. By using this method, bucket sizes are also increased as data sizes ___.
- Increase
- Decrease
- Minimized
- Maximized
Answer: A) Increase
Explanation:
By using this method, bucket sizes are also increased as data sizes increase.
Discuss this Question
13. The ____ address table will maintain the addresses.
- Bucket
- Data
- Block
- Log
Answer: A) Bucket
Explanation:
The bucket address table will maintain these addresses.
Discuss this Question
14. As buckets grow and shrink, the address of the data ___ accordingly.
- Repeats
- Changes
- Flows
- None
Answer: B) Changes
Explanation:
As buckets grow and shrink, the address of the data changes accordingly.
Discuss this Question
15. It becomes tedious to maintain the bucket address table if there is a big ___ in data.
- Increase
- Decrease
- Flow
- None
Answer: A) Increase
Explanation:
It becomes tedious to maintain the bucket address table if there is a big increase in data.
Discuss this Question
16. There will also be a ___ situation in the dynamic hashing.
- Data Overflow
- Data Underflow
- Bucket Overflow
- Bucket Underflow
Answer: C) Bucket Overflow
Explanation:
There will also be a bucket overflow situation in this case.
Discuss this Question
17. The bucket overflow situation might be reached much faster than static hashing.
- Static
- Dynamic
- Both a and b
- None of the above
Answer: A) Static
Explanation:
However, this situation might be reached much faster than static hashing.
Discuss this Question