1
What is the primary purpose of an index in a database?
Correct Answer
To speed up data retrieval operations
☑ MCQ PRACTICE
Database Management Systems Unit 5
Practice objective questions for quick revision and examination preparation. Try answering each question before revealing the answer.
Database Management Systems - Unit-5
2
Which indexing method is best suited for exact-match queries?
Correct Answer
Hash-based indexing
3
Which data structure is commonly used in Tree-based indexing?
Correct Answer
B-Tree or B+ Tree
4
Which of the following queries is Hash-based indexing NOT well-suited for?
Correct Answer
Range queries
5
What is a ‘bucket’ in the context of Hash-based indexing?
Correct Answer
A slot where data can be inserted or retrieved
6
What is the key feature of B-Trees?
Correct Answer
The tree is always balanced
7
Which of the following is NOT a type of indexing in DBMS?
Correct Answer
Bounded Indexing
8
What does a leaf node in a B+ Tree contain?
Correct Answer
Both keys and data pointers
9
Which of the following can be a disadvantage of indexing?
Correct Answer
Increased storage space
10
In which type of index are data and index entries stored together?
Correct Answer
Clustered Index
11
A unit of storage that can store one or more records in a hash file organization is denoted as
Correct Answer
Buckets
12
The file organization which allows us to read records that would satisfy the join condition by using one block read is
Correct Answer
Clustering file organization
13
Which file organization allows records to be stored in any available location?
Correct Answer
Heap
14
In which file organization are records stored sequentially based on a key field?
Correct Answer
Sequential
15
Which file organization is efficient for range queries?
Correct Answer
Indexed Sequential
16
In Hashing, the function used to determine the storage location of a record is called:
Correct Answer
Hash Function
17
Which of the following file organizations allows for quick retrieval based on a unique key?
Correct Answer
Hashing
18
In Indexed Sequential Access Method (ISAM), what is used to locate primary and secondary records?
Correct Answer
Indices
19
Which file organization does not require sorting of data?
Correct Answer
Heap
20
In which file organization is data stored in a sorted manner, but allows for additional data to be added easily?
Correct Answer
Dynamic Sequential
21
What is a drawback of sequential file organization?
Correct Answer
Slow insert and update
22
In a Clustered file organization, records from multiple tables that share a common field are stored together in:
Correct Answer
Clusters
23
Which type of index is created automatically when a primary key constraint is defined?
Correct Answer
Clustered Index
24
What is the primary purpose of query optimization?
Correct Answer
Reduce query execution time
25
What is the disadvantage of using too many indexes on a table?
Correct Answer
Slower data modification operations
26
What is heap file organization?
Correct Answer
Any record can be placed wherever there is a space for the record
27
What is sequential file organization?
Correct Answer
Records are stored in a sequential order according to a search key
28
What is hashing file organization?
Correct Answer
A hash function is computed on some attribute and that decides the block
29
What is the primary disadvantage of a clustered index?
Correct Answer
Slower updates and inserts
30
What is a secondary index primarily used for?
Correct Answer
To speed up data retrieval without affecting physical data order
31
In a secondary index, each entry is a pair consisting of:
Correct Answer
A secondary key and a list of block pointers
32
Which of the following types of index allows for non-unique values?
Correct Answer
Secondary Index
33
What does a clustered index do?
Correct Answer
Sorts the data rows in the table