Q#1: Storage management in DBMS deals with:
(A) Efficient storage and retrieval of data on disk
(B) Encrypting database
(C) Normalizing tables
(D) Backup scheduling
Answer: (A) Efficient storage and retrieval of data on disk
Q#2: Storage manager is responsible for:
(A) Interaction between DBMS and physical storage
(B) Writing SQL queries
(C) Encrypting data
(D) Normalization
Answer: (A) Interaction between DBMS and physical storage
Q#3: Which of the following is a component of storage management?
(A) File manager, buffer manager, disk manager
(B) Query parser
(C) Transaction manager
(D) Recovery manager
Answer: (A) File manager, buffer manager, disk manager
Q#4: File manager handles:
(A) Allocation and organization of database files on disk
(B) Query optimization
(C) Transaction commits
(D) Encryption
Answer: (A) Allocation and organization of database files on disk
Q#5: Buffer manager is responsible for:
(A) Managing data in main memory for efficient access
(B) Writing backups
(C) Encrypting queries
(D) Normalizing tables
Answer: (A) Managing data in main memory for efficient access
Q#6: Disk manager handles:
(A) Low-level read/write operations on disk
(B) Query parsing
(C) Transaction logging
(D) Index creation
Answer: (A) Low-level read/write operations on disk
Q#7: Primary storage refers to:
(A) Main memory (RAM)
(B) Hard disk
(C) Backup tapes
(D) Cloud storage only
Answer: (A) Main memory (RAM)
Q#8: Secondary storage refers to:
(A) Hard disks, SSDs, and other persistent storage
(B) Cache memory
(C) CPU registers
(D) Temporary buffers
Answer: (A) Hard disks, SSDs, and other persistent storage
Q#9: Tertiary storage is used for:
(A) Backup and archival purposes
(B) Primary query execution
(C) Main memory
(D) Cache only
Answer: (A) Backup and archival purposes
Q#10: Disk block is:
(A) Smallest unit of data transfer between disk and memory
(B) Entire file
(C) Entire database
(D) Only index data
Answer: (A) Smallest unit of data transfer between disk and memory
Q#11: Page or block buffering reduces:
(A) Disk I/O operations
(B) CPU usage
(C) Encryption overhead
(D) Normalization effort
Answer: (A) Disk I/O operations
Q#12: Fixed-length records are:
(A) Records of constant size
(B) Records of variable size
(C) Index entries only
(D) Only primary keys
Answer: (A) Records of constant size
Q#13: Variable-length records require:
(A) Additional pointers or delimiters
(B) Fixed allocation
(C) Only indexes
(D) Backup only
Answer: (A) Additional pointers or delimiters
Q#14: Contiguous storage allocates:
(A) Consecutive disk blocks for a file
(B) Random blocks
(C) Only index blocks
(D) Only primary key blocks
Answer: (A) Consecutive disk blocks for a file
Q#15: Linked allocation stores:
(A) Pointers to next block in the file
(B) Consecutive blocks only
(C) Only index entries
(D) Only metadata
Answer: (A) Pointers to next block in the file
Q#16: Indexed allocation uses:
(A) An index block to keep addresses of all file blocks
(B) Only sequential storage
(C) Only hash storage
(D) Only primary key
Answer: (A) An index block to keep addresses of all file blocks
Q#17: Advantages of contiguous storage include:
(A) Fast sequential access
(B) Easy insertion/deletion
(C) No fragmentation
(D) Efficient hash access
Answer: (A) Fast sequential access
Q#18: Disadvantages of contiguous storage include:
(A) External fragmentation
(B) Easy file expansion
(C) No need for indexing
(D) Fast access always
Answer: (A) External fragmentation
Q#19: Linked allocation avoids:
(A) External fragmentation
(B) Internal fragmentation
(C) Disk I/O
(D) CPU usage
Answer: (A) External fragmentation
Q#20: Indexed allocation supports:
(A) Direct access to blocks
(B) Only sequential access
(C) Only hash access
(D) Only backup access
Answer: (A) Direct access to blocks
Q#21: File organization affects:
(A) Data retrieval performance
(B) Encryption
(C) Normalization
(D) Backup only
Answer: (A) Data retrieval performance
Q#22: Clustered storage stores:
(A) Related records physically close
(B) Random records
(C) Only index blocks
(D) Only hash entries
Answer: (A) Related records physically close
Q#23: Buffer replacement policies include:
(A) LRU, FIFO, Clock
(B) B-Tree
(C) Hash index
(D) Sequential scan
Answer: (A) LRU, FIFO, Clock
Q#24: Least Recently Used (LRU) policy:
(A) Replaces page not used for the longest time
(B) Replaces most recent page
(C) Replaces random page
(D) Replaces first page
Answer: (A) Replaces page not used for the longest time
Q#25: First-In-First-Out (FIFO) policy:
(A) Replaces the oldest loaded page
(B) Replaces newest page
(C) Replaces random page
(D) Replaces least recently used page
Answer: (A) Replaces the oldest loaded page
Q#26: Disk scheduling algorithms include:
(A) FCFS, SSTF, SCAN, C-SCAN
(B) LRU only
(C) Hash only
(D) Indexed only
Answer: (A) FCFS, SSTF, SCAN, C-SCAN
Q#27: Storage management affects:
(A) Query performance, transaction throughput, and I/O cost
(B) Only encryption
(C) Only normalization
(D) Only backup
Answer: (A) Query performance, transaction throughput, and I/O cost
Q#28: Data compression in storage management:
(A) Reduces disk space usage
(B) Encrypts data
(C) Normalizes tables
(D) Manages transactions
Answer: (A) Reduces disk space usage
Q#29: RAID (Redundant Array of Independent Disks) improves:
(A) Performance and reliability of storage
(B) Query syntax
(C) Normalization
(D) Encryption only
Answer: (A) Performance and reliability of storage
Q#30: Main goal of storage management is:
(A) Efficient, reliable, and fast data storage and retrieval
(B) Backup only
(C) Encryption only
(D) Normalization only
Answer: (A) Efficient, reliable, and fast data storage and retrieval