ADVERTISEMENT
ADVERTISEMENT

DBMS Static Hashing MCQs

DBMS Static Hashing MCQs: This section contains multiple-choice questions and answers on Static Hashing in DBMS.
Submitted by Anushree Goswami, on April 24, 2022

1. Static hashing will always produce the same data ___ address.

  1. Bucket
  2. Block
  3. Set
  4. Item

Answer: A) Bucket

Explanation:

Static hashing will always produce the same data bucket address.

Discuss this Question


2. A constant number of data buckets is maintained throughout this static hashing.

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

Answer: A) Static

Explanation:

A constant number of data buckets is maintained throughout this static hashing.

Discuss this Question


3. How many operations of hashing are there?

  1. 2
  2. 3
  3. 4
  4. 5

Answer: C) 4

Explanation:

There are 4 operations of hashing.

Discuss this Question


4. Which of the following is an operation of hashing?

  1. Searching a record
  2. Insert a record
  3. Delete a record
  4. All of the above

Answer: D) All of the above

Explanation:

The operations of hashing are -

  1. Searching a record
  2. Insert a record
  3. Delete a record
  4. Update a record

Discuss this Question


5. A ___ function retrieves the bucket address when a record needs to be searched.

  1. Hash
  2. Heap
  3. Log
  4. None

Answer: A) Hash

Explanation:

A hash function retrieves the bucket address when a record needs to be searched.

Discuss this Question


6. An address for a new record will be generated based on the ___ key when a new record is inserted in the table, and the record is stored at that address.

  1. Primary
  2. Hash
  3. Foreign
  4. Alternate

Answer: B) Hash

Explanation:

An address for a new record will be generated based on the hash key when a new record is inserted in the table, and the record is stored at that address.

Discuss this Question


7. We must first ___ a record that is intended to be deleted before we can delete it.

  1. Add
  2. Fetch
  3. Delete
  4. Update

Answer: B) Fetch

Explanation:

We must first fetch a record that is intended to be deleted before we can delete it.

Discuss this Question


8. After fetching, the record will be deleted from ___.

  1. Data
  2. Record
  3. Memory
  4. Storage

Answer: C) Memory

Explanation:

Afterwards, they will be deleted from memory.

Discuss this Question


9. To update a record, we use a hash function to first ___ for it, and then update the record.

  1. Add
  2. Update
  3. Search
  4. None

Answer: C) Search

Explanation:

To update a record, we use a hash function to first search for it, and then update the record.

Discuss this Question


10. The condition in which a record needs to be inserted into the file, but the bucket generated by the hash function is not empty, or the bucket already contains some data, is known as ___ when using static hashing, and it is a critical situation.

  1. Data Overflow
  2. Bucket Overflow
  3. File Overflow
  4. Dat Underflow

Answer: B) Bucket Overflow

Explanation:

The condition in which a record needs to be inserted into the file, but the bucket generated by the hash function is not empty, or the bucket already contains some data, is known as bucket overflow when using static hashing, and it is a critical situation.

Discuss this Question


11. To overcome the situation of bucket overflow, how many methods are there?

  1. 2
  2. 3
  3. 4
  4. 5

Answer: A) 2

Explanation:

There are 2 methods to overcome the situation of bucket overflow.

Discuss this Question


12. Which of the following is the method to overcome bucket overflow?

  1. Open Hashing
  2. Closed Hashing
  3. Both A and B
  4. None of the above

Answer: C) Both A and B

Explanation:

The methods to overcome bucket overflow are -

  1. Open Hashing
  2. Closed Hashing

Discuss this Question


13. Hash functions generate addresses at which data has already been stored and the next bucket is allocated to that address by the linear probing mechanism.

  1. Algebraic
  2. Arithmetic
  3. Probing
  4. Doping

Answer: C) Probing

Explanation:

Hash functions generate addresses at which data has already been stored and the next bucket is allocated to that address by the linear probing mechanism.

Discuss this Question


14. ___ refers to the process of allocating a new bucket for a given hash result and linking it after the previous one, when buckets are full.

  1. Open Hashing
  2. Linear Probing
  3. Overflow Chaining
  4. None

Answer: C) Overflow Chaining

Explanation:

Overflow chaining refers to the process of allocating a new bucket for a given hash result and linking it after the previous one, when buckets are full.

Discuss this Question


15. Linear Probing comes in which of the following hashing?

  1. Open Hashing
  2. Close Hashing
  3. Both A and B
  4. None of the above

Answer: A) Open Hashing

Explanation:

Linear Probing comes in the open hashing.

Discuss this Question


16. Overflow Chaining comes in which hashing?

  1. Open Hashing
  2. Close Hashing
  3. Both A and B
  4. None of the above

Answer: B) Close Hashing

Explanation:

Overflow Chaining comes in Close Hashing.

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.