The wait-for graph can only be used for deadlock detection when there is a single instance of each type.
True
The _____ is an approximation of a program's locality.
working set
Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and a system with three page frames, what is the final configuration of the three frames after the true LRU algorithm is applied?
3,1,4,
The value of a counting semaphore can range only between 0 and 1.
False
Name at least one modern programming language that has incorporated the idea of a monitor.
Java
Lock ordering cannot guarantee protection from deadlock.
True
Without a mechanism such as an address-space identifier, the TLB must be flushed during a context switch.
True
Which of the following is true of multilevel queue scheduling?
