Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages
Filter by Categories
nmims post
Objective Type Set
Online MCQ Assignment
Question Solution
Solved Question
Uncategorized

1. The term ______ is used to denote a unit of storage that can store one or more records
a) Basket
b) Bucket
c) Unit
d) Set

View Answer

Answer: b [Reason:] The term bucket is used to denote a unit of storage that can store one or more records. A bucket is typically a disk block but it can also be larger than a disk block.

2. If K denotes the set of all the search key values, and B denotes the set of all bucket addresses, a function from K to B is called as __________
a) Bucket function
b) Address function
c) Hash function
d) Search function

View Answer

Answer: c [Reason:] If K denotes the set of all the search key values, and B denotes the set of all bucket addresses, a function h from K to B is called as the hash function. It determines which bucket should contain the data in question.

3. In a __________ , we obtain the address of the disk block containing a desired record directly by computing a function on the search key value of the record
a) Hash file organization
b) Hash index organization
c) Hashing address
d) None of the mentioned

View Answer

Answer: a [Reason:] Hashing can be used for 2 different purposes, hash file organization and hash index organization. In a Hash file organization, we obtain the address of the disk block containing a desired record directly by computing a function on the search key value of the record.

4. In a __________ we organize the search keys, with their associated pointers, into a hash file structure
a) Hash file organization
b) Hash index organization
c) Hashing address
d) None of the mentioned

View Answer

Answer: b [Reason:] Hashing can be used for 2 different purposes, hash file organization and hash index organization. In a hash index organization, we organize the search keys, with their associated pointers, into a hash file structure.

5. What is a bucket overflow?
a) When a bucket does not have enough space
b) There are insufficient buckets
c) When Bucket skew occurs
d) All of the mentioned

View Answer

Answer: d [Reason:] Bucket overflow can occur in many ways. When a bucket does not have enough space, there are insufficient buckets, when a bucket skew occurs.

6. Some buckets are assigned more records than the others which causes bucket overflow, this condition is called as ________
a) Bucket sufficiency
b) Bucket insufficiency
c) Bucket skew
d) Bucket normalcy

View Answer

Answer: c [Reason:] Some buckets are assigned more records than the others which causes bucket overflow, this condition is called as Bucket skew. Skew occurs if multiple records have the same search key or if the given hash function is non uniform.

7. Overflow handling using a linked list of buckets is called as ____________
a) Bucket chaining
b) Overflow chaining
c) Bucket linking
d) Overflow linking

View Answer

Answer: b [Reason:] All the overflow buckets are chained together in a linked list. Overflow handling using a linked list of buckets is called as Overflow chaining.

8. State true or false: A hash index organizes the search keys, with their associated pointers, into a hash file structure
a) True
b) False

View Answer

Answer: a [Reason:] A hash index organizes the search keys, with their associated pointers, into a hash file structure. We can construct a hash index by applying a hash function on a search key and store the key and its associated pointers in the bucket.

9. Which of the following is the worst hash function among the given choices
a) The sum of the digits modulo 8
b) The sum of the digits modulo 2
c) The sum of the digits modulo 5
d) The sum of the digits

View Answer

Answer: d [Reason:] The sum of the digits classifies the data into the highest number of buckets, thus making the job to track the buckets more difficult than the rest.

10. State true or false: Hash indices are only primary index structures
a) True
b) False

View Answer

Answer: a [Reason:] Hash indices are only secondary index structures. A hash index is never needed as a clustering index structure.