GATE Operating System: Deadlock – Previous Year Questions

8 GATE previous year questions on Deadlock (Operating System, Computer Science) with answers and explanations, from every paper.

GATE 2017 CS Q37 (2 marks, Multiple choice) – A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory…
GATE 2018 CS Q34 (1 mark, Numerical answer) – Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource…
GATE 2018 CS Q49 (2 marks, Multiple choice) – In a system, there are three types of resources: E, F and G. Four processes P 0, P 1, P 2 and P 3 execute concurrently. At the outset, the processes…
GATE 2019 CS Q49 (2 marks, Multiple choice) – Consider the following snapshot of a system running n concurrent processes. Process i is holding X i instances of a resource R, 1 i n. Assume that all…
GATE 2026 CS (CS1) Q29 (1 mark, Multiple select) – With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
GATE 2026 CS (CS1) Q35 (1 mark, Numerical answer) – Consider a system consisting of k instances of a resource R, being shared by 5 processes. Assume that each process requires a maximum of two instances…
GATE 2025 CS (CS2) Q48 (2 marks, Multiple select) – P = \P 1, P 2, P 3, P 4\ consists of all active processes in an operating system. R = \R 1, R 2, R 3, R 4\ consists of single instances of distinct…
GATE 2022 CS Q26 (1 mark, Multiple select) – Which of the following statements is/are TRUE with respect to deadlocks?