Q#1: The main purpose of indexing in DBMS is to:
(A) Speed up data retrieval
(B) Reduce storage
(C) Encrypt data
(D) Normalize tables
Answer: (A) Speed up data retrieval
Q#2: An index is created on:
(A) One or more columns of a table
(B) Only primary key
(C) Entire table only
(D) Database schema only
Answer: (A) One or more columns of a table
Q#3: Which type of index stores data in sorted order?
(A) Clustered index
(B) Non-clustered index
(C) Bitmap index
(D) Hash index
Answer: (A) Clustered index
Q#4: Non-clustered index:
(A) Stores index separately from table data
(B) Stores table in sorted order
(C) Cannot be created on a table
(D) Stores only primary key
Answer: (A) Stores index separately from table data
Q#5: A primary key automatically creates:
(A) Unique clustered index
(B) Non-unique index
(C) Bitmap index
(D) Hash index
Answer: (A) Unique clustered index
Q#6: A unique index ensures:
(A) No duplicate values in indexed columns
(B) Duplicate values allowed
(C) Only one row exists in table
(D) Only primary key exists
Answer: (A) No duplicate values in indexed columns
Q#7: A bitmap index is useful when:
(A) Column has low cardinality (few distinct values)
(B) Column has high cardinality
(C) Table has only one row
(D) Table is empty
Answer: (A) Column has low cardinality (few distinct values)
Q#8: B-Tree index is:
(A) Balanced tree structure suitable for range queries
(B) Unbalanced tree
(C) Hash structure
(D) Bitmap
Answer: (A) Balanced tree structure suitable for range queries
Q#9: Hash index is suitable for:
(A) Equality searches
(B) Range queries
(C) Sorting
(D) Joins
Answer: (A) Equality searches
Q#10: Clustered index determines:
(A) Physical order of rows in table
(B) Only logical order
(C) Only hash values
(D) Bitmap positions
Answer: (A) Physical order of rows in table
Q#11: Non-clustered index does NOT determine:
(A) Physical order of table rows
(B) Search order
(C) Logical order of index
(D) Efficiency of query
Answer: (A) Physical order of table rows
Q#12: Single-level index has:
(A) One level of pointers to data
(B) Multiple levels
(C) B-Tree structure
(D) Hash buckets
Answer: (A) One level of pointers to data
Q#13: Multi-level index improves:
(A) Search performance for large tables
(B) Storage only
(C) Encryption
(D) Normalization
Answer: (A) Search performance for large tables
Q#14: Dense index has:
(A) An index entry for every record in table
(B) Index entries for some records only
(C) Only primary key entries
(D) Only hash values
Answer: (A) An index entry for every record in table
Q#15: Sparse index has:
(A) Index entries for some records only
(B) Index entries for every record
(C) Only primary key
(D) Hash only
Answer: (A) Index entries for some records only
Q#16: Indexing improves:
(A) SELECT query performance
(B) INSERT and UPDATE performance
(C) Delete performance only
(D) Storage efficiency only
Answer: (A) SELECT query performance
Q#17: A disadvantage of indexing is:
(A) Additional storage requirement
(B) Faster query performance
(C) Data integrity
(D) Normalization
Answer: (A) Additional storage requirement
Q#18: Indexing may slow down:
(A) INSERT, UPDATE, DELETE operations
(B) SELECT queries
(C) Table creation
(D) Schema modification only
Answer: (A) INSERT, UPDATE, DELETE operations
Q#19: Composite index is:
(A) Index on multiple columns
(B) Index on single column
(C) Bitmap index
(D) Hash index
Answer: (A) Index on multiple columns
Q#20: Covering index contains:
(A) All columns needed by a query
(B) Only indexed column
(C) Only primary key
(D) Only hash values
Answer: (A) All columns needed by a query
Q#21: Reverse key index helps to:
(A) Reduce index contention
(B) Increase redundancy
(C) Normalize table
(D) Encrypt data
Answer: (A) Reduce index contention
Q#22: Function-based index is:
(A) Index built on expressions or functions of columns
(B) Index on primary key only
(C) Hash index only
(D) Bitmap only
Answer: (A) Index built on expressions or functions of columns
Q#23: Clustered index is limited to:
(A) One per table
(B) Multiple per table
(C) None
(D) Unlimited
Answer: (A) One per table
Q#24: Non-clustered index can be:
(A) Multiple per table
(B) One per table
(C) Only on primary key
(D) Only on foreign key
Answer: (A) Multiple per table
Q#25: Index-only scan uses:
(A) Index without accessing table data
(B) Table data without index
(C) Both index and table always
(D) Hash only
Answer: (A) Index without accessing table data
Q#26: Index on foreign key helps:
(A) Speed up JOIN operations
(B) Reduce SELECT performance
(C) Encrypt data
(D) Normalize table
Answer: (A) Speed up JOIN operations
Q#27: Clustered vs Non-clustered index:
(A) Clustered determines physical order, non-clustered does not
(B) Both determine physical order
(C) Both store index separately
(D) Both use hash
Answer: (A) Clustered determines physical order, non-clustered does not
Q#28: Index scan types include:
(A) Full index scan, range scan, unique scan
(B) Only full scan
(C) Only unique scan
(D) Only range scan
Answer: (A) Full index scan, range scan, unique scan
Q#29: B+ Tree index stores:
(A) All values in leaf nodes linked sequentially
(B) Only root node
(C) Only hash values
(D) Only primary key
Answer: (A) All values in leaf nodes linked sequentially
Q#30: Main goal of indexing is:
(A) Efficient query processing and data retrieval
(B) Encrypt data
(C) Normalize database
(D) Backup database
Answer: (A) Efficient query processing and data retrieval