Home »
MCQs »
DBMS MCQs
DBMS Hashing MCQs
DBMS Hashing MCQs: This section contains multiple-choice questions and answers on Hashing in DBMS.
Submitted by Anushree Goswami, on April 24, 2022
1. When a database structure has a huge number of index values, it is very ___ to search all of them for the desired information.
- Sufficient
- Efficient
- Inefficient
- None
Answer: C) Inefficient
Explanation:
When a database structure has a huge number of index values, it is very inefficient to search all of them for the desired information.
Discuss this Question
2. By using the hashing algorithm, it is possible to find a data record directly on the disk without the need for an index.
- Hashing
- Static Hashing
- Dynamic Hashing
- None
Answer: A) Hashing
Explanation:
By using the hashing algorithm, it is possible to find a data record directly on the disk without the need for an index.
Discuss this Question
3. A hashing function is used to generate the ___ of the data blocks in this technique.
- Data
- Addresses
- Numbers
- Records
Answer: B) Addresses
Explanation:
A hashing function is used to generate the addresses of the data blocks in this technique.
Discuss this Question
4. A ___ is a memory location where these records are stored.
- Data bucket
- Data block
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
A data bucket or a data block is a memory location where these records are stored.
Discuss this Question
5. Any value in the column can be used by a ___ function to generate the address.
- Log
- Data
- Hash
- Heap
Answer: C) Hash
Explanation:
Any value in the column can be used by a hash function to generate the address.
Discuss this Question
6. To generate the address of a data block, the hash function most often uses the ___ key.
- Primary
- Foreign
- Composite
- Alternate
Answer: A) Primary
Explanation:
To generate the address of a data block, the hash function most often uses the primary key.
Discuss this Question
7. Hash functions are a simple ___ function, which can be applied to any complex ___ function.
- Algebraic
- Arithmetic
- Integrate
- Mathematical
Answer: D) Mathematical
Explanation:
Hash functions are a simple mathematical function, which can be applied to any complex mathematical function.
Discuss this Question
8. The primary key may even be considered to be the address of a data block.
- Data Address
- Data Set
- Data Block
- Data Item
Answer: C) Data Block
Explanation:
The primary key may even be considered to be the address of a data block.
Discuss this Question
9. The data block will consist of every row whose address is the same as its primary key.
- Alternate
- Composite
- Foreign
- Primary
Answer: D) Primary
Explanation:
Therefore, the data block will consist of every row whose address is the same as its primary key.
Discuss this Question
10. How many types of hashing are there?
- 2
- 3
- 4
- 5
Answer: A) 2
Explanation:
There are 2 types of hashing.
Discuss this Question
11. Which of the following is the type of hashing?
- Static
- Dynamic
- Both A and B
- None of the above
Answer: C) Both A and B
Explanation:
The types of hashing are -
- Static
- Dynamic
Discuss this Question