

MCQOPTIONS
Saved Bookmarks
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Rdbms knowledge and support exam preparation. Choose a topic below to get started.
1. |
___________ are the indices that store the values of some attributes along with the pointers to the recor. |
A. | Binary indices |
B. | Covering indices |
C. | Key indices |
D. | Static indices |
Answer» C. Key indices | |
2. |
Insertion of a large number of entries at a time into an index is referred to as _______ of the index. |
A. | Bulk loading |
B. | Mass insertion |
C. | Quick insertion |
D. | Quick loading |
Answer» B. Mass insertion | |
3. |
Statement 1: Insertion of record might require the change in position of the initial nodes.Statement 2: Deletion of records might require the change in position of the initial nodes. |
A. | Both the statements are true |
B. | Statement 1 is true but statement 2 is false |
C. | Statement 2 is true but statement 1 is false |
D. | Both the statements are false |
Answer» B. Statement 1 is true but statement 2 is false | |
4. |
____________ARE_THE_INDICES_THAT_STORE_THE_VALUES_OF_SOME_ATTRIBUTES_ALONG_WITH_THE_POINTERS_TO_THE_RECOR.?$ |
A. | Binary indices |
B. | Covering indices |
C. | Key indices |
D. | Static indices |
Answer» C. Key indices | |
5. |
Insertion of a large number of entries at a time into an index is referred to as _______ of the index? |
A. | Bulk loading |
B. | Mass insertion |
C. | Quick insertion |
D. | Quick loading |
Answer» B. Mass insertion | |
6. |
State true or false: The fanout of nodes can be increased by using a technique called _________ |
A. | Prefix compression |
B. | Postfix compression |
C. | Prefix expansion |
D. | Postfix expansion |
Answer» B. Postfix compression | |
7. |
If a relation can have more than one record containing the same search key value, the search key is said to be a __________ |
A. | Unique search key |
B. | Non unique search key |
C. | Multiple search key |
D. | Identical search key |
Answer» C. Multiple search key | |
8. |
Statement 1: Insertion of record might require the change in position of the initial nodes. |
A. | |
B. | Both the statements are true |
C. | Statement 1 is true but statement 2 is false |
Answer» B. Both the statements are true | |
9. |
The queries used to find all records with search key values in a particular range are known as ________ |
A. | Gap queries |
B. | Graph queries |
C. | Range queries |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
10. |
Non-leaf nodes are also called as __________ |
A. | Internal nodes |
B. | External nodes |
C. | Middle nodes |
D. | Primary nodes |
Answer» B. External nodes | |
11. |
What are the leaf nodes in a B+ tree? |
A. | The topmost nodes |
B. | The bottommost nodes |
C. | The nodes in between the top and bottom nodes |
D. | None of the mentioned |
Answer» C. The nodes in between the top and bottom nodes | |
12. |
State true or false: B+ trees are not always balanced trees. |
A. | True |
B. | False |
Answer» C. | |