A state is safe, if ____________

• A. The system does not crash due to deadlock occurrence
• B. The system can allocate resources to each process in some order and still avoid a deadlock
• C. The state keeps the system protected and safe
• D. All of the mentioned

A system is in a safe state only if there exists a ____________

• A. Safe allocation
• B. Safe resource
• C. Safe sequence
• D. All of the mentioned

All unsafe states are ____________

• A. Deadlocks
• B. Not deadlocks
• C. Fatal
• D. None of the mentioned

A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. advertisement Process P0 P1 P2 Maximum needs (process-wise: P0 through P2 top to bottom) 10 4 9 Currently allocated (process-wise) 5 2 2 Which of the following sequence is a safe sequence?

• A. P0, p1, p2
• B. P1, p2, p0
• C. P2, p0, p1
• D. P1, p0, p2

If no cycle exists in the resource allocation graph ____________

• A. Then the system will not be in a safe state
• B. Then the system will be in a safe state
• C. All of the mentioned
• D. None of the mentioned

The resource allocation graph is not applicable to a resource allocation system ____________

• A. With multiple instances of each resource type
• B. With a single instance of each resource type
• C. Single & multiple instances of each resource type
• D. None of the mentioned

The Banker’s algorithm is _____________ than the resource allocation graph algorithm.

• A. Less efficient
• B. More efficient
• C. Equal
• D. None of the mentioned

The data structures available in the Banker’s algorithm are ____________

• A. Available
• B. Need
• C. Allocation
• D. All of the mentioned

The content of the matrix Need is ____________

• A. Allocation €? available
• B. Max €? available
• C. Max €? allocation
• D. Allocation €? max

A system with 5 processes P0 through P4 and three resource types A, B, C have A with 10 instances, B with 5 instances, and C with 7 instances. At time t0, the following snapshot has been taken: Process P0 P1 P2 P3 P4 Allocation (process-wise : P0 through P4 top TO bottom) A B C 0 1 0 2 0 0 3 0 2 2 1 1 0 0 2 MAX (process-wise: P0 through P4 top TO bottom) A B C 7 5 3 3 2 2 9 0 2 2 2 2 4 3 3 Available A B C 3 3 2 The sequence leads the system to ____________

• A. An unsafe state
• B. A safe state
• C. A protected state
• D. A deadlock