1. What is Index ? Junior A. a balanced multiway search tree storing keys and record pointers in every node B. an index with one entry for every search-key value in the data file C. an auxiliary structure that speeds up data lookup at the cost of extra storage and write effort D. an index with an entry only for some keys, typically one per data block
2. Which term means: "an auxiliary structure that speeds up data lookup at the cost of extra storage and write effort"? Junior A. Index B. Multilevel index C. Clustered index D. Bitmap index
3. Which statement is correct? Junior A. Index — an auxiliary structure that speeds up data lookup at the cost of extra storage and write effort B. Index — an index whose order physically determines how the table's rows are stored on disk C. Index — an index built on the ordering key of a sequentially ordered data file D. Index — an index using a hash function to map keys to buckets for fast equality lookups
4. What is Primary index ? Mid A. an index built on top of another index to reduce the number of blocks searched B. an index built on the ordering key of a sequentially ordered data file C. an index using bit arrays per value, efficient for columns with few distinct values D. the linking of leaf nodes that lets a B+ tree perform efficient ordered range queries
5. Which term means: "an index built on the ordering key of a sequentially ordered data file"? Mid A. B+ tree index B. Clustered index C. Heap file D. Primary index
6. Which statement is correct? Mid A. Primary index — an index with an entry only for some keys, typically one per data block B. Primary index — a balanced tree keeping all keys in linked leaves for efficient range and sequential scans C. Primary index — an index with one entry for every search-key value in the data file D. Primary index — an index built on the ordering key of a sequentially ordered data file
7. What is Secondary index ? Mid A. a balanced multiway search tree storing keys and record pointers in every node B. an auxiliary structure that speeds up data lookup at the cost of extra storage and write effort C. the linking of leaf nodes that lets a B+ tree perform efficient ordered range queries D. an index built on a non-ordering attribute to support lookups on a second field
8. Which term means: "an index built on a non-ordering attribute to support lookups on a second field"? Mid A. Sparse index B. Dense index C. Secondary index D. Hash index
9. Which statement is correct? Mid A. Secondary index — an index built on a non-ordering attribute to support lookups on a second field B. Secondary index — an index using a hash function to map keys to buckets for fast equality lookups C. Secondary index — a balanced tree keeping all keys in linked leaves for efficient range and sequential scans D. Secondary index — the linking of leaf nodes that lets a B+ tree perform efficient ordered range queries
10. What is Clustered index ? Mid A. an index with one entry for every search-key value in the data file B. an index built on top of another index to reduce the number of blocks searched C. an index whose order physically determines how the table's rows are stored on disk D. an index built on a non-ordering attribute to support lookups on a second field
11. Which term means: "an index whose order physically determines how the table's rows are stored on disk"? Mid A. B-tree index B. Sparse index C. Clustered index D. Primary index
12. Which statement is correct? Mid A. Clustered index — a balanced multiway search tree storing keys and record pointers in every node B. Clustered index — an index built on the ordering key of a sequentially ordered data file C. Clustered index — an index whose order physically determines how the table's rows are stored on disk D. Clustered index — an index using a hash function to map keys to buckets for fast equality lookups
13. What is Dense index ? Mid A. the linking of leaf nodes that lets a B+ tree perform efficient ordered range queries B. an index whose order physically determines how the table's rows are stored on disk C. an index with one entry for every search-key value in the data file D. an auxiliary structure that speeds up data lookup at the cost of extra storage and write effort
14. Which term means: "an index with one entry for every search-key value in the data file"? Mid A. Multilevel index B. Dense index C. Primary index D. Clustered index
15. Which statement is correct? Mid A. Dense index — an index built on top of another index to reduce the number of blocks searched B. Dense index — the linking of leaf nodes that lets a B+ tree perform efficient ordered range queries C. Dense index — an index with one entry for every search-key value in the data file D. Dense index — an index using a hash function to map keys to buckets for fast equality lookups
16. What is Sparse index ? Mid A. an index with an entry only for some keys, typically one per data block B. a balanced multiway search tree storing keys and record pointers in every node C. a balanced tree keeping all keys in linked leaves for efficient range and sequential scans D. an index built on a non-ordering attribute to support lookups on a second field
17. Which term means: "an index with an entry only for some keys, typically one per data block"? Mid A. Multilevel index B. Index C. Sparse index D. B+ tree index
18. Which statement is correct? Mid A. Sparse index — an index built on top of another index to reduce the number of blocks searched B. Sparse index — an index with an entry only for some keys, typically one per data block C. Sparse index — a balanced multiway search tree storing keys and record pointers in every node D. Sparse index — an index using bit arrays per value, efficient for columns with few distinct values
19. What is B-tree index ? Mid A. an index whose order physically determines how the table's rows are stored on disk B. an index built on the ordering key of a sequentially ordered data file C. an index with one entry for every search-key value in the data file D. a balanced multiway search tree storing keys and record pointers in every node
20. Which term means: "a balanced multiway search tree storing keys and record pointers in every node"? Mid A. B+ tree index B. B-tree index C. Bitmap index D. Heap file
21. Which statement is correct? Mid A. B-tree index — an index with an entry only for some keys, typically one per data block B. B-tree index — an unordered file that simply appends new records wherever free space exists C. B-tree index — an index whose order physically determines how the table's rows are stored on disk D. B-tree index — a balanced multiway search tree storing keys and record pointers in every node
22. What is B+ tree index ? Senior A. an index using a hash function to map keys to buckets for fast equality lookups B. a balanced tree keeping all keys in linked leaves for efficient range and sequential scans C. an unordered file that simply appends new records wherever free space exists D. a balanced multiway search tree storing keys and record pointers in every node
23. Which term means: "a balanced tree keeping all keys in linked leaves for efficient range and sequential scans"? Senior A. Heap file B. Primary index C. B+ tree index D. Dense index
24. Which statement is correct? Senior A. B+ tree index — a balanced tree keeping all keys in linked leaves for efficient range and sequential scans B. B+ tree index — an index whose order physically determines how the table's rows are stored on disk C. B+ tree index — an index with an entry only for some keys, typically one per data block D. B+ tree index — an index built on a non-ordering attribute to support lookups on a second field
25. What is Hash index ? Mid A. an index using a hash function to map keys to buckets for fast equality lookups B. an index with one entry for every search-key value in the data file C. an unordered file that simply appends new records wherever free space exists D. a balanced multiway search tree storing keys and record pointers in every node
26. Which term means: "an index using a hash function to map keys to buckets for fast equality lookups"? Mid A. Sparse index B. Clustered index C. Heap file D. Hash index
27. Which statement is correct? Mid A. Hash index — an index using a hash function to map keys to buckets for fast equality lookups B. Hash index — an index built on top of another index to reduce the number of blocks searched C. Hash index — an auxiliary structure that speeds up data lookup at the cost of extra storage and write effort D. Hash index — an index with an entry only for some keys, typically one per data block
28. What is Heap file ? Junior A. an index with one entry for every search-key value in the data file B. a balanced tree keeping all keys in linked leaves for efficient range and sequential scans C. an auxiliary structure that speeds up data lookup at the cost of extra storage and write effort D. an unordered file that simply appends new records wherever free space exists
29. Which term means: "an unordered file that simply appends new records wherever free space exists"? Junior A. Hash index B. Heap file C. B+ tree index D. Primary index
30. Which statement is correct? Junior A. Heap file — an index built on the ordering key of a sequentially ordered data file B. Heap file — an index using bit arrays per value, efficient for columns with few distinct values C. Heap file — an unordered file that simply appends new records wherever free space exists D. Heap file — a balanced multiway search tree storing keys and record pointers in every node Showing 30 of 39 DBMS · Indexing & Storage questions — the full set, with answers, explanations and an AI tutor on every question, is inside.