MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
State true or false: Hash indices are only primary index structures |
| A. | True |
| B. | False |
| Answer» B. False | |
| 2. |
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 |
| Answer» E. | |
| 3. |
State true or false: A hash index organizes the search keys, with their associated pointers, into a hash file structure |
| A. | True |
| B. | False |
| Answer» B. False | |
| 4. |
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 |
| Answer» E. | |
| 5. |
State_true_or_false:_Hash_indices_are_only_primary_index_structures$ |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
State true or false: A hash index organizes the search keys, with their associated pointers, into a hash file structur? |
| A. | True |
| B. | False |
| Answer» B. False | |
| 7. |
Overflow handling using a linked list of buckets is called as ____________ |
| A. | Bucket chaining |
| B. | Overflow chaining |
| C. | Bucket linking |
| D. | Overflow linking |
| Answer» C. Bucket linking | |
| 8. |
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 |
| Answer» D. Bucket normalcy | |
| 9. |
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 |
| Answer» E. | |
| 10. |
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 |
| Answer» C. Hashing address | |
| 11. |
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 |
| Answer» B. Hash index organization | |
| 12. |
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 |
| Answer» D. Search function | |
| 13. |
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 |
| Answer» C. Unit | |