Q#1: Mass-storage devices are used to:
(A) Store large amounts of data permanently
(B) Only CPU registers
(C) Only cache memory
(D) Only main memory
Answer: (A) Store large amounts of data permanently
Q#2: Examples of mass-storage devices include:
(A) Hard disks, SSDs, magnetic tapes
(B) CPU registers
(C) Cache memory
(D) Main memory
Answer: (A) Hard disks, SSDs, magnetic tapes
Q#3: Primary difference between main memory and mass storage is:
(A) Volatility and speed
(B) Size only
(C) CPU usage only
(D) Cache usage only
Answer: (A) Volatility and speed
Q#4: Disk access time consists of:
(A) Seek time, rotational latency, and transfer time
(B) Only CPU cycles
(C) Only cache access
(D) Only memory access
Answer: (A) Seek time, rotational latency, and transfer time
Q#5: Seek time is:
(A) Time to move the disk arm to the desired track
(B) Time to rotate disk
(C) CPU idle time
(D) Memory access time
Answer: (A) Time to move the disk arm to the desired track
Q#6: Rotational latency is:
(A) Time for the desired sector to rotate under the read/write head
(B) CPU idle time
(C) Disk failure
(D) Memory access time
Answer: (A) Time for the desired sector to rotate under the read/write head
Q#7: Transfer time is:
(A) Time to actually transfer data to or from the disk
(B) CPU idle
(C) Disk seek
(D) Memory transfer
Answer: (A) Time to actually transfer data to or from the disk
Q#8: Disk scheduling algorithms improve:
(A) Disk throughput and response time
(B) Only CPU performance
(C) Only memory access
(D) Only cache speed
Answer: (A) Disk throughput and response time
Q#9: FCFS (First-Come, First-Served) disk scheduling serves requests:
(A) In the order they arrive
(B) By shortest seek time
(C) Randomly
(D) By priority only
Answer: (A) In the order they arrive
Q#10: SSTF (Shortest Seek Time First) selects request:
(A) Closest to current head position
(B) First request in queue
(C) Random request
(D) Only CPU request
Answer: (A) Closest to current head position
Q#11: SCAN algorithm moves:
(A) Disk arm in one direction servicing requests until end, then reverses
(B) Random requests
(C) Only CPU tasks
(D) Only memory blocks
Answer: (A) Disk arm in one direction servicing requests until end, then reverses
Q#12: C-SCAN (Circular SCAN) differs from SCAN by:
(A) Returning head to beginning without servicing on return
(B) Serving all requests randomly
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Returning head to beginning without servicing on return
Q#13: LOOK algorithm:
(A) Moves head only as far as last request in each direction
(B) Moves to disk end always
(C) CPU idle
(D) Disk failure
Answer: (A) Moves head only as far as last request in each direction
Q#14: C-LOOK algorithm:
(A) Like LOOK but returns head to first request instead of disk end
(B) Moves head to disk end
(C) CPU idle
(D) Memory full
Answer: (A) Like LOOK but returns head to first request instead of disk end
Q#15: RAID stands for:
(A) Redundant Array of Independent Disks
(B) Random Access of Internal Disks
(C) Rapid Access of Internal Data
(D) Redundant Access in Disk
Answer: (A) Redundant Array of Independent Disks
Q#16: RAID 0 provides:
(A) Striping without redundancy
(B) Mirroring
(C) Parity
(D) Only backup
Answer: (A) Striping without redundancy
Q#17: RAID 1 provides:
(A) Mirroring for fault tolerance
(B) Striping
(C) Parity
(D) Only cache
Answer: (A) Mirroring for fault tolerance
Q#18: RAID 5 uses:
(A) Block-level striping with distributed parity
(B) Mirroring only
(C) Striping without parity
(D) Only CPU registers
Answer: (A) Block-level striping with distributed parity
Q#19: Magnetic disks store data using:
(A) Magnetic patterns on platters
(B) Electrical signals only
(C) CPU registers
(D) Cache memory
Answer: (A) Magnetic patterns on platters
Q#20: SSDs store data using:
(A) Flash memory
(B) Magnetic platters
(C) CPU registers
(D) Only cache lines
Answer: (A) Flash memory
Q#21: Tapes are:
(A) Sequential-access storage devices
(B) Random-access devices
(C) Only CPU registers
(D) Only cache
Answer: (A) Sequential-access storage devices
Q#22: Disk formatting prepares a disk by:
(A) Dividing into tracks and sectors
(B) Only writing data
(C) Only CPU scheduling
(D) Only memory allocation
Answer: (A) Dividing into tracks and sectors
Q#23: Cylinder refers to:
(A) Set of tracks aligned vertically across platters
(B) Disk sector
(C) Memory block
(D) CPU register
Answer: (A) Set of tracks aligned vertically across platters
Q#24: Block in storage is:
(A) Smallest unit of data transfer
(B) CPU register
(C) Disk track
(D) Cache line
Answer: (A) Smallest unit of data transfer
Q#25: Access time of disk depends on:
(A) Seek time + rotational latency + transfer time
(B) CPU cycles only
(C) Memory access only
(D) Cache hits
Answer: (A) Seek time + rotational latency + transfer time
Q#26: Disk controller manages:
(A) Communication between CPU and disk
(B) Only cache
(C) Only memory
(D) CPU registers
Answer: (A) Communication between CPU and disk
Q#27: Mass-storage system includes:
(A) Storage device, controller, and software
(B) Only disk
(C) Only CPU
(D) Only memory
Answer: (A) Storage device, controller, and software
Q#28: Sequential-access devices are:
(A) Accessed in order, e.g., tape
(B) Random access devices
(C) CPU registers
(D) Cache lines
Answer: (A) Accessed in order, e.g., tape
Q#29: Random-access devices are:
(A) Data can be accessed in any order, e.g., disk
(B) Tape
(C) CPU registers
(D) Cache lines
Answer: (A) Data can be accessed in any order, e.g., disk
Q#30: Disk latency is:
(A) Sum of seek time and rotational latency
(B) Only seek time
(C) Only transfer time
(D) CPU idle
Answer: (A) Sum of seek time and rotational latency
Q#31: Transfer rate is:
(A) Speed of moving data to/from disk
(B) CPU utilization
(C) Memory access time
(D) Cache speed
Answer: (A) Speed of moving data to/from disk
Q#32: Logical block addressing (LBA) allows:
(A) Disk blocks numbered linearly
(B) Only track/sector addressing
(C) CPU registers
(D) Cache lines
Answer: (A) Disk blocks numbered linearly
Q#33: File systems use mass storage to:
(A) Store and retrieve files efficiently
(B) Only CPU operations
(C) Only cache management
(D) Only memory usage
Answer: (A) Store and retrieve files efficiently
Q#34: Disk partitioning divides:
(A) Disk into independent logical units
(B) CPU registers
(C) Cache lines
(D) Memory blocks
Answer: (A) Disk into independent logical units
Q#35: Formatting a disk:
(A) Prepares it for file system usage
(B) CPU scheduling
(C) Memory allocation
(D) Cache optimization
Answer: (A) Prepares it for file system usage
Q#36: Bad blocks are:
(A) Disk sectors that cannot reliably store data
(B) CPU errors
(C) Memory faults
(D) Cache misses
Answer: (A) Disk sectors that cannot reliably store data
Q#37: Disk mirroring duplicates:
(A) Data on two disks for redundancy
(B) Only CPU registers
(C) Memory blocks
(D) Cache lines
Answer: (A) Data on two disks for redundancy
Q#38: Disk striping improves:
(A) Throughput by spreading data across multiple disks
(B) CPU speed
(C) Memory allocation
(D) Cache usage
Answer: (A) Throughput by spreading data across multiple disks
Q#39: Solid-state drives are:
(A) Faster and more reliable than magnetic disks
(B) Slower than disks
(C) Only sequential devices
(D) Only cache devices
Answer: (A) Faster and more reliable than magnetic disks
Q#40: Access time of SSD is mainly:
(A) Read/write latency of flash memory
(B) Seek time
(C) Rotational latency
(D) Disk transfer time
Answer: (A) Read/write latency of flash memory
Q#41: RAID improves:
(A) Reliability, performance, or both
(B) Only CPU speed
(C) Only cache
(D) Only memory
Answer: (A) Reliability, performance, or both
Q#42: Striping without redundancy is suitable for:
(A) Performance-focused applications
(B) Fault tolerance
(C) Disk backup
(D) Memory management
Answer: (A) Performance-focused applications
Q#43: Mirroring provides:
(A) Fault tolerance
(B) Performance only
(C) CPU optimization
(D) Cache efficiency
Answer: (A) Fault tolerance
Q#44: Mass storage software includes:
(A) Device drivers, file systems, disk utilities
(B) CPU registers
(C) Cache management
(D) Memory allocation
Answer: (A) Device drivers, file systems, disk utilities
Q#45: Disk cache stores:
(A) Frequently accessed disk blocks in memory
(B) CPU registers
(C) Cache lines only
(D) Disk blocks permanently
Answer: (A) Frequently accessed disk blocks in memory
Q#46: Mass storage access can be:
(A) Sequential or random
(B) Only sequential
(C) Only random
(D) Only CPU-bound
Answer: (A) Sequential or random
Q#47: Magnetic tape is cheaper than disk but:
(A) Slower and sequential-access only
(B) Faster than disk
(C) Random access
(D) CPU-bound
Answer: (A) Slower and sequential-access only
Q#48: Storage virtualization combines:
(A) Multiple physical devices into a single logical device
(B) CPU registers
(C) Cache memory
(D) Main memory blocks
Answer: (A) Multiple physical devices into a single logical device
Q#49: Data integrity in mass storage ensures:
(A) Data is not corrupted during storage or retrieval
(B) CPU idle
(C) Memory full
(D) Cache cleared
Answer: (A) Data is not corrupted during storage or retrieval
Q#50: Main goal of mass-storage management:
(A) Reliable, efficient, and cost-effective data storage
(B) CPU optimization only
(C) Cache management only
(D) Memory allocation only
Answer: (A) Reliable, efficient, and cost-effective data storage