Success is the sum of small efforts repeated day in and day out.— Robert Collier

Operating System — quick quiz

5 real GATE CSE questions on Operating System. Instant scoring and solutions, no signup — see where you stand in ~3 minutes.

Question 1 of 5

HARD

A system uses the Banker's algorithm for deadlock avoidance. There are 3 resource types R1, R2, R3 with total instances (9, 5, 7). Three processes P1, P2, P3 have maximum needs (4, 2, 3), (2, 3, 4), and (3, 2, 2) respectively. Currently allocated resources are (2, 1, 1), (1, 1, 2), and (2, 1, 1). If P2 requests (0, 1, 1), will the system remain in a safe state?