CS201 Quiz 3

A race introduces the element of chance, which is a highly desirable attribute, in database management. True False

False

Deadlock does not usually affect the entire system. True False

False

Deadlock was a serious problem for early batch systems. True False

False

In general, operating systems must either choose avoidance or recovery as a strategy for dealing with deadlocks. True False

False

In the dining philosophers problem, there are five philosophers and four forks. True False

False

A livelock can be caused by two processes accessing different areas of the same disk. True False

True

Although the Banker's Algorithm has been used to avoid deadlocks in systems with a few resources, it isn't practical for most systems. True False

True

Database locking should be done only at the level of the entire database. True False

True

First-come, first-served (FCFS) is the simplest device-scheduling algorithm; it is easy to program and essentially fair to users. True False

True

RAID Level 0 is not considered a true form of RAID because it cannot recover from hardware failure. True False

True

When using the Banker's Algorithm, an operating system must be sure never to satisfy a request that moves it from a safe state to an unsafe one. True False

True

____ is when each process involved in an impasse is waiting for another to voluntarily release its resources so that at least one process will be able to continue. a. Circular wait b. Resource holding c. No preemption d. Mutual exclusion

a. Circular wait

A ____, used in RAID Level 2, is a coding scheme that adds extra, redundant bits to the data and is therefore able to correct single-bit errors and detect double-bit errors. a. Hamming code b. Parity code c. Synch code d. Redundancy code

a. Hamming code

The Printer Event 1 P1 requests and is allocated the printer R1. 2 P1 releases the printer R1. 3 P2 requests and is allocated the disk drive R2. 4 P2 releases the disk R2. 5 P3 requests and is allocated the plotter R3. 6 P3 releases the plotter R3. Assume that the events in the accompanying narrative take place. Which of the following statements is true? a. There is no deadlock. b. Event 4 caused deadlock. c. Event 5 caused deadlock. d. Event 6 caused deadlock.

a. There is no deadlock.

Failure to lock database records before updating them may result in a ____ between processes. a. race b. timeout c. livelock d. struggle

a. race

The I/O ____ allocates the devices, control units, and channels. a. scheduler b. director c. traffic controller d. device handler

a. scheduler

The number of characters that can be recorded per inch on a magnetic tape is determined by the ____ of the tape. a. length b. density c. width d. parity

b. density

____ published a visual tool to show how deadlock conditions can be modeled using directed graphs. a. Havender b. Dijkstra c. Holt d. Lane & Mooney

c. Holt

Transfer rate of a magnetic tape is measured in inches per second (ips) using the following formula: transfer rate = density * ____. a. block size b. average access time c. transport speed d. sector size

c. transport speed

The USB controller assigns bandwidth to each device depending on its priority. The ____ priority is assigned to real-time exchanges where no interruption in the data flow is allowed, such as video or sound data. a. standard b. lowest c. medium d. highest

d. highest