ADVERTISEMENT
ADVERTISEMENT

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.

  1. Sufficient
  2. Efficient
  3. Inefficient
  4. 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.

  1. Hashing
  2. Static Hashing
  3. Dynamic Hashing
  4. 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.

  1. Data
  2. Addresses
  3. Numbers
  4. 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.

  1. Data bucket
  2. Data block
  3. Both A and B
  4. 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.

  1. Log
  2. Data
  3. Hash
  4. 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.

  1. Primary
  2. Foreign
  3. Composite
  4. 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.

  1. Algebraic
  2. Arithmetic
  3. Integrate
  4. 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.

  1. Data Address
  2. Data Set
  3. Data Block
  4. 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.

  1. Alternate
  2. Composite
  3. Foreign
  4. 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?

  1. 2
  2. 3
  3. 4
  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?

  1. Static
  2. Dynamic
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

The types of hashing are -

  1. Static
  2. Dynamic

Discuss this Question



ADVERTISEMENT
ADVERTISEMENT


Comments and Discussions!



ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT

Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates

© https://www.includehelp.com some rights reserved.