Deadlock : OS

1. In this Algorithm, it is assumed that a deadlock will never occur

A.Banker's Algorithm
B.Dijkstra's algorithm
C.Ostrich Algorithm
D.Greedy Algorithm


This approach may be used in dealing with deadlocks in concurrent programming if they are believed to be very rare and the cost of detection or prevention is high. It is named for the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem."

2. Resources are allocated to the process on non-sharable basis is

A. mutual exclusion
B. hold and wait
C. no pre-emption
D. circular wait

3. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

A. resource allocation graph
B. starvation graph
C. inversion graph
D. none of the mentioned

4.Name the situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function.

A.Starvation
B.Fragmentation
C.Deadlock
D.None of these

5. Banker's algorithm is

A.Deadlock Prevention
B.Deadlock Detection
C.Deadlock Avoidance
D.All of these