CS604 Quiz 3 by VU Topper RM

Possible side effects of __________deadlocks are low device utilization and reduced system throughput. A. Ignoring B. Avoiding C. Recovering

D. Preventing

Which of the following is correct definition for wait operation?

1. wait(S) { while(S<=0);// no o S--; Page 108
2. wait(S) { S++; }
3. wait(S) { while(S>=0) ;// no op S--; }
4. wait(S) { S--; }

Correct answer: wait(S) { while(S<=0);// no o S--; Page 108

The -----------scheme is not applicable to a resource allocation system with multiple instances of each resource type.

A. Wait for graph Page 145

B. None of the given options C. Resource allocation graph D. Both Resource-allocation and wait-for graph

Semaphores are used to synchronize ________ processes. A. Tough B. Parallel C. Running

D. Concurrent

Following is not the classical problem of synchronization. A. Bounded buffer problem B. Reader writer problem C. Dining philosophers problem

D. Counting Semaphore problem Page 118

In Resource Allocation Graph, a _________Pi ---> Rj indicates that process Pi may request resource Rj at some time in the future.

A. Claim edge Page 138

B. Request edge C. Allocation edge D. Assignment edge

__________ is used in the detection and recovery mechanism to handle deadlocks. A. Circular Graph

B. Wait-for Graph Page 144

C. Claim Edge Graph D. Resource allocation Graph

Typically monitor, a high level synchronization tool is characterized by ___________ and ______________. A. Signal, wait B. Local variables, semaphores C. Global variable,local variable

D. Local data, programmer defined operators Page 125

In order to remove the problem like busy waiting, some high level synchronization constructs are defined. What are they?

Critical regions and Monitors Page 124

Critical regions and Semaphores

The integer value of _________ semaphores can not be greater than 1. A. Mutex

B. Binary Page 117

C. Counting D. Bounded buffer Banker’s algorithm is used for ________________ A. Deadlock removal B. Deadlock detection C. Deadlock prevention

D. Deadlock avoidance Page 140

________________ is an integer variable accessible through wait and signal which are atomic operations. A. Signal B. Mutex

C. Semaphore Page 111

D. Busy waiting

The _____________________requires that once a writer is ready, that writer performs its write as soon as possible. In other words, if a writer is waiting to access the object, no new readers may start reading. A. first readers-writers problem B. third readers-writers problem C. fourth readers-writers problem

D. second readers-writers problem Page 116

A state is ___________ if the system can allocate resources for each process in some order and still avoid a deadlock.

A. Safe Page 134

B. Unsafe C. Mutual D. Starvation

___________ algorithm is used in Deadlock avoidance. A. Bakery

B. Banker’s Page 139

C. Safe Sequence D. Mutual exclusion