

MCQOPTIONS
Saved Bookmarks
This section includes 24 Mcqs, each offering curated multiple-choice questions to sharpen your Database knowledge and support exam preparation. Choose a topic below to get started.
1. |
A search key containing more than one attribute is called a _________ search key |
A. | Multiple |
B. | Multilevel |
C. | Composite |
D. | Primary |
Answer» C. Composite | |
2. |
Indices with two or more levels are called as? |
A. | Multiple Indices |
B. | Multilevel indices |
C. | Bi- tri- Indices |
D. | None of the mentioned |
Answer» C. Bi- tri- Indices | |
3. |
If an index entry appears for only some of the search key values in the file, it is called as ________ |
A. | Dense key |
B. | Dense index |
C. | Sparse key |
D. | Sparse index |
Answer» E. | |
4. |
If an index entry appears for every search key value in the file, it is called as ________ |
A. | Dense key |
B. | Dense index |
C. | Sparse key |
D. | Sparse index |
Answer» C. Sparse key | |
5. |
The types of access that are supported efficiently are called as ________ |
A. | Access modes |
B. | Access types |
C. | Access time |
D. | Access overhead |
Answer» C. Access time | |
6. |
WHILE_INSERTING_THE_RECORD_INTO_THE_INDEX,_IF_THE_SEARCH-KEY_VALUE_DOES_NOT_APPEAR_IN_THE_INDEX.?$ |
A. | The system adds a pointer to the new record in the index entry |
B. | The system places the record being inserted after the other records with the same search-key values |
C. | The system inserts an index entry with the search-key value in the index at the appropriate position |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
7. |
IF_AN_INDEX_ENTRY_APPEARS_FOR_ONLY_SOME_OF_THE_SEARCH_KEY_VALUES_IN_THE_FILE,_IT_IS_CALLED_AS_________?$ |
A. | Dense key |
B. | Dense index |
C. | Sparse key |
D. | Sparse index |
Answer» E. | |
8. |
INSERTION_OF_A_LARGE_NUMBER_OF_ENTRIES_AT_A_TIME_INTO_AN_INDEX_IS_REFERRED_TO_AS____________OF_THE_INDEX.?$ |
A. | Loading |
B. | Bulk insertion |
C. | Bulk loading |
D. | Increase insertion |
Answer» D. Increase insertion | |
9. |
Indices_with_two_or_more_levels_are_called_as?$ |
A. | Multiple Indices |
B. | Multilevel indices |
C. | Bi- tri- Indices |
D. | None of the mentioned |
Answer» C. Bi- tri- Indices | |
10. |
If an index entry appears for every search key value in the file, it is called as _______? |
A. | Dense key |
B. | Dense index |
C. | Sparse key |
D. | Sparse index |
Answer» C. Sparse key | |
11. |
In B+ tree the node which points to another node is calle? |
A. | Leaf node |
B. | External node |
C. | Final node |
D. | Internal node |
Answer» E. | |
12. |
State true or false: Clustering indices are also called as primary indices |
A. | True |
B. | False |
Answer» B. False | |
13. |
A search key containing more than one attribute is referred to as a _________ search key. |
A. | Simple |
B. | Composite |
C. | Compound |
D. | Secondary |
Answer» C. Compound | |
14. |
If the file containing the records is sequentially ordered, a ___________ is an index whose search key also defines the sequential order of the file. |
A. | Clustering data |
B. | Cluttering index |
C. | Clustering index |
D. | Clustering number |
Answer» C. Clustering index | |
15. |
Incase the indices values are larger, index is created for these values of the index. This is called |
A. | Pointed index |
B. | Sequential index |
C. | Multilevel index |
D. | Multiple index |
Answer» D. Multiple index | |
16. |
The additional space occupied by an index structure is called as _________ |
A. | Access modes |
B. | Space types |
C. | Access time |
D. | Space overhead |
Answer» E. | |
17. |
In a __________ index, an index entry appears for only some of the search-key values. |
A. | Dense |
B. | Sparse |
C. | Straight |
D. | Continuous |
Answer» B. Sparse | |
18. |
The time it takes to delete a data item is called as _________ |
A. | Insertion time |
B. | Deletion time |
C. | Time overhead |
D. | Access time |
Answer» C. Time overhead | |
19. |
In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers. |
A. | Dense |
B. | Sparse |
C. | Straight |
D. | Continuous |
Answer» B. Sparse | |
20. |
The time it takes to insert a new data item is called ____________ |
A. | Insertion time |
B. | Deletion time |
C. | Time overhead |
D. | Access time |
Answer» B. Deletion time | |
21. |
An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value. |
A. | Index entry |
B. | Index hash |
C. | Index cluster |
D. | Index map |
Answer» B. Index hash | |
22. |
The time it takes to find a particular data item is called as ___________ |
A. | Insertion time |
B. | Deletion time |
C. | Time overhead |
D. | Access time |
Answer» E. | |
23. |
Indices whose search key specifies an order different from the sequential order of the file are called ___________ indices. |
A. | Nonclustered |
B. | Secondary |
C. | All of the mentioned |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
24. |
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» B. Structured index | |