NSCT – Indexing & File Organization MCQs

20 min Score: 0 Attempted: 0/20

1. . Indexing in DBMS is used to:
(A) Compress tables
(B) Improve the speed of data retrieval from a database
(C) Encrypt data
(D) Delete old records

2. . A primary index is:
(A) An index on foreign keys only
(B) An index created on a primary key of a table
(C) An encrypted index
(D) A backup index

3. . A secondary index is:
(A) Encrypted index
(B) An index on primary keys only
(C) Compressed index
(D) An index created on non-primary key attributes

4. . Dense index stores:
(A) Only one entry per block
(B) An index entry for every search key value in the data file
(C) Only primary keys
(D) Only compressed data

5. . Sparse index stores:
(A) Index entries for every record
(B) Index entries for only some of the search key values
(C) Only encrypted data
(D) Only primary keys

6. . A clustered index:
(A) Stores a separate copy
(B) Arranges the actual data in the order of the index
(C) Compresses data
(D) Encrypts data

7. . A non-clustered index:
(A) Stores pointers to the actual data location
(B) Arranges data physically
(C) Compresses data
(D) Encrypts data

8. . Hash-based indexing uses:
(A) Sorting of data only
(B) A hash function to compute the address of data
(C) Encryption of keys
(D) Compression of blocks

9. . B-Tree index is:
(A) Compressed file
(B) An encrypted table
(C) A balanced tree structure used to maintain sorted data and allow searches, insertions, deletions
(D) Backup table

10. . B+ Tree differs from B-Tree because:
(A) All values are stored in leaf nodes and leaf nodes are linked
(B) Values are stored only in internal nodes
(C) Data is compressed
(D) Data is encrypted

11. . Heap file organization stores:
(A) Encrypted records
(B) Records sorted by a key
(C) Records in arbitrary order
(D) Compressed blocks

12. . Sequential file organization stores:
(A) Arbitrary order
(B) Records in sorted order based on a key
(C) Compressed data
(D) Encrypted data

13. . Hash file organization stores:
(A) Records encrypted
(B) Records sequentially
(C) Records arbitrarily
(D) Records at addresses computed by a hash function

14. . Advantages of indexing include:
(A) Deleting old records automatically
(B) Compressing tables
(C) Encrypting tables
(D) Faster retrieval, efficient search, reduced disk I/O

15. . Disadvantages of indexing include:
(A) Better integrity
(B) Faster queries
(C) Extra storage space and slower insert/update/delete operations
(D) No extra storage

16. . Multi-level index is:
(A) An encrypted index
(B) A compressed index
(C) An index on an index to reduce search time
(D) A backup index

17. . Composite index is:
(A) An index on a single column
(B) An index on multiple columns of a table
(C) Compressed index
(D) Encrypted index

18. . Dense vs Sparse index trade-off:
(A) Dense provides faster search but uses more space; Sparse uses less space but slower search
(B) Dense uses less space
(C) Sparse is faster
(D) Both are same

19. . Indexes must be updated when:
(A) Data is compressed
(B) Records are inserted, deleted, or updated in the table
(C) Data is encrypted
(D) Data is backed up

20. . The main purpose of Indexing & File Organization is to:
(A) Improve data retrieval efficiency, organize files, and maintain performance
(B) Compress tables
(C) Encrypt tables
(D) Delete old data automatically

Exit mobile version