Quiz 6

Question 1

The free-space list can be implemented using a bit vector approach. What is a drawback of this technique?

Answer 1

It is not feasible to keep the entire list in main memory for large disks

Question 2

What allocation method ensures that only one access is needed to get a disk block using direct access?

Answer 2

contiguous allocation

Question 3

What is true about an environment where several processes may open the same file at the same time?

Answer 3

the operating system typically uses two internal tables called the system-wide and per-process tables to keep track of open files.

Question 4

A(n) ____ is a buffer that holds output for a device that cannot accept interleaved data streams.

Answer 4

spool

Question 5

What is a principle that can improve the efficiency of I/O and reduce CPU usage?

Answer 5

Move processing primitives into hardware, e.g., DMA

Question 6

Direct memory access is a technique that___

Answer 6

enables the associated controller to read and write data directly from/to primary memory with no CPU intervention during data transfer.

Question 7

The list of processes waiting for a particular I/O device is called a(n) ____.

Answer 7

device queue

Question 8

Starvation may occur in the FCFS disk-scheduling discipline.

Answer 8

False

Question 9

In symbolic link, two i-nodes will be created for a file.

Answer 9

False

Question 10

SSDs often use an FCFS disk-scheduling algorithm.

Answer 10

True