Exam 11: Mass-Storage Structure
Exam 1: Introduction57 Questions
Exam 2: Operating-System Structures42 Questions
Exam 3: Processes55 Questions
Exam 4: Threads Concurrency59 Questions
Exam 5: Cpu Scheduling57 Questions
Exam 6: Synchronization Tools61 Questions
Exam 7: Synchronization Examples57 Questions
Exam 8: Deadlocks40 Questions
Exam 9: Main Memory58 Questions
Exam 10: Virtual Memory54 Questions
Exam 11: Mass-Storage Structure46 Questions
Exam 12: Io Systems30 Questions
Exam 13: File-System Interface50 Questions
Exam 14: File-System Implementation36 Questions
Exam 15: File-System Internals25 Questions
Exam 16: Security32 Questions
Exam 17: Protection32 Questions
Select questions type
Disk controllers do not usually have a built-in cache.
Free
(True/False)
4.9/5
(34)
Correct Answer:
False
Describe one technique that can enable multiple disks to be used to improve data transfer rate.
Free
(Essay)
4.7/5
(42)
Correct Answer:
One technique is bit-level striping. Bit-level striping consists of splitting the bits of each byte across multiple disks so that the data can be accessed from multiple disks in parallel. Another method is block-level striping where blocks of a file are striped across multiple disks.
Number of sectors per track increases as we move from inner zone to outer zone, because
(Multiple Choice)
5.0/5
(34)
Solid state disks (SSDs) commonly use the ___________ disk scheduling policy.
(Multiple Choice)
4.8/5
(29)
SCAN disk head scheduling offers no practical benefit over FCFS disk head scheduling.
(True/False)
4.8/5
(29)
In general, SCAN disk head scheduling will involve less movement of the disk heads than C-SCAN disk head scheduling.
(True/False)
4.8/5
(30)
Which of the following is FALSE about Storage Area Networks?
(Multiple Choice)
4.9/5
(46)
Which of the following disk head scheduling algorithms does not take into account the current position of the disk head?
(Multiple Choice)
4.7/5
(33)
Disk scheduling algorithms in operating systems consider only seek distances, because
(Multiple Choice)
4.9/5
(30)
Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3, 11, 75, 185, 100, 87. Using the SCAN scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders?
(Multiple Choice)
4.8/5
(38)
Describe why Solaris systems only allocate swap space when a page is forced out of main memory, rather than when the virtual memory page is first created.
(Essay)
4.9/5
(31)
Showing 1 - 20 of 46
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)