Exam 11: Mass-Storage Structure

arrow
  • Select Tags
search iconSearch Question
flashcardsStudy Flashcards
  • Select Tags

Disk controllers do not usually have a built-in cache.

Free
(True/False)
4.9/5
(34)
Correct Answer:
Verified

False

An I/O system call does not include

Free
(Multiple Choice)
4.8/5
(34)
Correct Answer:
Verified

C

Describe one technique that can enable multiple disks to be used to improve data transfer rate.

Free
(Essay)
4.7/5
(42)
Correct Answer:
Verified

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.

What are the two components of positioning time?

(Multiple Choice)
4.8/5
(39)

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)

Which of the following is FALSE about swap space use?

(Multiple Choice)
4.9/5
(25)

DRAMs are now commonly used for mass data storage, because

(Multiple Choice)
4.8/5
(27)

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)

RAID level ____ is the most common parity RAID system.

(Multiple Choice)
4.9/5
(31)

A full bootstrap program

(Multiple Choice)
4.9/5
(39)

RAID level 0 provides no redundancy.

(True/False)
4.9/5
(31)

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)

What is a storage-area network?

(Essay)
4.9/5
(37)

Disk scheduling algorithms in operating systems consider only seek distances, because

(Multiple Choice)
4.9/5
(30)

In a swap map in Linux

(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
close modal

Filters

  • Essay(0)
  • Multiple Choice(0)
  • Short Answer(0)
  • True False(0)
  • Matching(0)