MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 21 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 operations is used for the union of bitmaps? |
| A. | Logical AND |
| B. | Logical OR |
| C. | Logical NOT |
| D. | Logical NOR |
| Answer» C. Logical NOT | |
| 2. |
State true or false: Intersection operations are extremely slow on bitmaps |
| A. | True |
| B. | False |
| Answer» C. | |
| 3. |
We delete and index in SQL using the ________ command |
| A. | Remove index |
| B. | Delete index |
| C. | Drop index |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 4. |
A bitmap is _______ |
| A. | An array of bits |
| B. | An index of bits |
| C. | A function mapping all the bits of data |
| D. | None of the mentioned |
| Answer» B. An index of bits | |
| 5. |
A_TABLESPACE_IS_FURTHER_BROKEN_DOWN_INTO_________?$ |
| A. | Tablespace |
| B. | Segments |
| C. | Extents |
| D. | Blocks |
| Answer» B. Segments | |
| 6. |
STATE_TRUE_OR_FALSE:_INTERSECTION_OPERATIONS_ARE_EXTREMELY_SLOW_ON_BITMAPS?$ |
| A. | True |
| B. | False |
| Answer» C. | |
| 7. |
In_ordered_indices_the_file_containing_the_records_is_sequentially_ordered,_a_____________is_an_index_whose_search_key_also_defines_the_sequential_order_of_the_file.$ |
| A. | Clustered index |
| B. | Structured index |
| C. | Unstructured index |
| D. | Nonclustered index |
| Answer» D. Nonclustered index | |
| 8. |
Which_of_the_following_operations_is_used_for_the_union_of_bitmaps?$ |
| A. | Logical AND |
| B. | Logical OR |
| C. | Logical NOT |
| D. | Logical NOR |
| Answer» C. Logical NOT | |
| 9. |
In a B+-tree index ______ for each value, we would normally maintain a list of all records with that value for the indexed attribute? |
| A. | Leaf |
| B. | Node |
| C. | Root |
| D. | Link |
| Answer» C. Root | |
| 10. |
We delete and index in SQL using the ________ comman? |
| A. | Remove index |
| B. | Delete index |
| C. | Drop index |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 11. |
Bitmaps can be combined with regular B+-tree indices for relations where a few attribute values are extremely common, and other values also occur, but much less frequently. |
| A. | Bitmap, B-tree |
| B. | Bitmap, B+tree |
| C. | B-tree, Bitmap |
| D. | B+tree, Bitmap |
| Answer» B. Bitmap, B+tree | |
| 12. |
We create an index in SQL using _______ command |
| A. | Create index |
| B. | New index |
| C. | Create new index |
| D. | Develop index |
| Answer» B. New index | |
| 13. |
Bitmaps can be used as a compressed storage mechanism at the leaf nodes of ________ for those values that occur very frequently. |
| A. | B-trees |
| B. | B+-trees |
| C. | Bit trees |
| D. | Both B-trees and B+-trees |
| Answer» C. Bit trees | |
| 14. |
State true or false: Bitmaps can be combined with B+ trees |
| A. | True |
| B. | False |
| Answer» B. False | |
| 15. |
To identify the deleted records we use the ______________ |
| A. | Existence bitmap |
| B. | Current bitmap |
| C. | Final bitmap |
| D. | Deleted bitmap |
| Answer» C. Final bitmap | |
| 16. |
The complement operation in bitmaps is done by using |
| A. | Logical AND |
| B. | Logical OR |
| C. | Logical NOT |
| D. | Logical NOR |
| Answer» D. Logical NOR | |
| 17. |
What does an existence bitmap do? |
| A. | It recognizes deleted records |
| B. | It inserts values into empty bitmaps |
| C. | It makes sure that no records are deleted |
| D. | None of the mentioned |
| Answer» B. It inserts values into empty bitmaps | |
| 18. |
Intersection of the bitmaps is done by |
| A. | Logical AND |
| B. | Logical OR |
| C. | Logical NOT |
| D. | Logical NOR |
| Answer» B. Logical OR | |
| 19. |
A _______ on the attribute A of relation r consists of one bitmap for each value that A can take. |
| A. | Bitmap index |
| B. | Bitmap |
| C. | Index |
| D. | Array |
| Answer» B. Bitmap | |
| 20. |
A _________ on the attribute A of relation r consists of one bitmap for each value that A can take |
| A. | Bitmap array |
| B. | Bitmap index |
| C. | Bitmap excess |
| D. | Bitmap |
| Answer» C. Bitmap excess | |
| 21. |
A bitmap is _______ |
| A. | An array of bits |
| B. | An index of bits |
| C. | A function mapping all the bits of data |
| D. | None of the mentioned |
| Answer» B. An index of bits | |