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. |
Which of the following hash function classifies data into the highest number of buckets ? |
| A. | Sum of digits modulo 8 |
| B. | Sum of digits modulo 5 |
| C. | Sum of digits modulo 2 |
| D. | Sum of digits |
| Answer» E. | |
| 2. |
Which of the following hash function classifies data into least number of buckets? |
| A. | Sum of digits modulo 8 |
| B. | Sum of digits modulo 5 |
| C. | Sum of digits modulo 2 |
| D. | Sum of digits |
| Answer» B. Sum of digits modulo 5 | |
| 3. |
The form of dynamic hashing that avoids the additional level of indirection is called as _________ |
| A. | Linear hashing |
| B. | Static hashing |
| C. | Directive hashing |
| D. | Indirective hashing |
| Answer» B. Static hashing | |
| 4. |
WHICH_OF_THE_FOLLOWING_HASH_FUNCTION_CLASSIFIES_DATA_INTO_LEAST_NUMBER_OF_BUCKETS??$ |
| A. | Sum of digits modulo 8 |
| B. | Sum of digits modulo 5 |
| C. | Sum of digits modulo 2 |
| D. | Sum of digits |
| Answer» B. Sum of digits modulo 5 | |
| 5. |
Which of the following hash function classifies data into the highest number of buckets ?$ |
| A. | Sum of digits modulo 8 |
| B. | Sum of digits modulo 5 |
| C. | Sum of digits modulo 2 |
| D. | Sum of digits |
| Answer» E. | |
| 6. |
Which of the following is an issue that needs to be considered while choosing an indexing technique? |
| A. | Frequency of insertion and deletion |
| B. | Data types of the data |
| C. | Number of items in the relation |
| D. | None of the mentioned |
| Answer» B. Data types of the data | |
| 7. |
Hash structures are not the best choice for which of the following? |
| A. | A search key on which individual point queries are likely |
| B. | A search key which is invalid |
| C. | A search key on which range queries are likely |
| D. | A search key on which multi-level queries are likely |
| Answer» D. A search key on which multi-level queries are likely | |
| 8. |
The form of dynamic hashing that avoids the additional level of indirection is called as _________ |
| A. | Linear hashing |
| B. | Static hashing |
| C. | Directive hashing |
| D. | Indirective hashing |
| Answer» B. Static hashing | |
| 9. |
Which of the following is a disadvantage of the dynamic hashing structure |
| A. | Buckets can be allocated dynamically |
| B. | Lookup involves additional level of indirection |
| C. | It involves a lesser space overhead |
| D. | Hash structure can be modified dynamically |
| Answer» C. It involves a lesser space overhead | |
| 10. |
The space overhead in dynamic hashing is ________ than that of static hashing |
| A. | More |
| B. | Less |
| C. | Equal |
| D. | None of the mentioned |
| Answer» C. Equal | |
| 11. |
Which of the following operations can be performed on an extendable hash structure? |
| A. | Lookup |
| B. | Insertion |
| C. | Deletion |
| D. | All of the mentioned |
| Answer» E. | |
| 12. |
Dynamic hashing is also called as _________ |
| A. | Extended hashing |
| B. | Extendable hashing |
| C. | Static hashing |
| D. | Movable hashing |
| Answer» C. Static hashing | |
| 13. |
Dynamic hashing allows us to? |
| A. | Accommodate the growth of the database |
| B. | Accommodate the shrinkage of the database |
| C. | Allows modification of hash function |
| D. | All of the mentioned |
| Answer» E. | |