V.vv
A deadlock is preceded by five simultaneous conditions that are not necessary for the operating system to run smoothly.
F
A race introduces the element of chance, an element that is desirable in database management.
F
Deadlock does not usually affect the entire system.
F
Deadlock was a serious problem for early batch systems.
F
In a directed graph used to model deadlock, processes are represented using squares.
F
It is easy to design a foolproof deadlock prevention policy.
F
Locking can be done only at the level of the entire database.
F
Most systems have transformed the printer into a sharable device by installing a high-speed device, a disk, between it and the CPU.
F
Mutual exclusion should be eliminated from a computer system to avoid deadlock.
F
A livelock is caused by two processes accessing different areas of the same disk.
T
Deadlock is a system-wide tangle of resource requests that begins when two or more jobs are put on hold, each waiting for a vital resource to become available.
T
Deadlocks are most serious in real-time systems.
T
If locks are not used to preserve their integrity, the updated records in a database might include only some of the data—and their contents would depend on the order in which each process finishes its execution.
T
Resource holding, where a job holds on to one resource while waiting for another one that's not yet available, could be sidestepped by forcing each job to request, at creation time, every resource it will need to run to completion.
T
When modeling deadlock, if there's a cycle in the graph, then there is a deadlock involving the processes and the resources in the cycle.
T
