18 real Hazards questions from the Concurrency bank, as asked in Indian campus drives and tech interviews. Every question has a verified answer and an AI-tutor explanation on placd — free to start.
1. What is Race condition?
Junior
A.the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters
B.a defect where program correctness depends on the unpredictable interleaving or relative timing of operations on shared state
C.a condition where a task is perpetually denied the resources it needs because others are continually favored by the scheduler or locking policy
D.a state in which two or more tasks are each blocked forever, every one waiting on a resource held by another in the group
A.Race condition — a state in which two or more tasks are each blocked forever, every one waiting on a resource held by another in the group
B.Race condition — a defect where program correctness depends on the unpredictable interleaving or relative timing of operations on shared state
C.Race condition — the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters
D.Race condition — the prevention technique of always acquiring multiple locks in a single globally agreed sequence to break the circular-wait requirement
A.Deadlock — a situation where tasks keep changing state in response to each other yet make no useful progress, despite never being blocked
B.Deadlock — the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters
C.Deadlock — a condition where a task is perpetually denied the resources it needs because others are continually favored by the scheduler or locking policy
D.Deadlock — a state in which two or more tasks are each blocked forever, every one waiting on a resource held by another in the group
A.Livelock — a situation where tasks keep changing state in response to each other yet make no useful progress, despite never being blocked
B.Livelock — a condition where a task is perpetually denied the resources it needs because others are continually favored by the scheduler or locking policy
C.Livelock — the prevention technique of always acquiring multiple locks in a single globally agreed sequence to break the circular-wait requirement
D.Livelock — the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters
11. Which term means: "a condition where a task is perpetually denied the resources it needs because others are continually favored by the scheduler or locking policy"?
A.Starvation — a situation where tasks keep changing state in response to each other yet make no useful progress, despite never being blocked
B.Starvation — the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters
C.Starvation — the prevention technique of always acquiring multiple locks in a single globally agreed sequence to break the circular-wait requirement
D.Starvation — a condition where a task is perpetually denied the resources it needs because others are continually favored by the scheduler or locking policy
14. Which term means: "the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters"?
A.Coffman conditions — the prevention technique of always acquiring multiple locks in a single globally agreed sequence to break the circular-wait requirement
B.Coffman conditions — the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters
C.Coffman conditions — a condition where a task is perpetually denied the resources it needs because others are continually favored by the scheduler or locking policy
D.Coffman conditions — a defect where program correctness depends on the unpredictable interleaving or relative timing of operations on shared state
17. Which term means: "the prevention technique of always acquiring multiple locks in a single globally agreed sequence to break the circular-wait requirement"?
A.Lock ordering — the four requirements that must all hold for a circular wait failure: mutual exclusion, hold-and-wait, no preemption, and a cycle of waiters
B.Lock ordering — the prevention technique of always acquiring multiple locks in a single globally agreed sequence to break the circular-wait requirement
C.Lock ordering — a defect where program correctness depends on the unpredictable interleaving or relative timing of operations on shared state
D.Lock ordering — a condition where a task is perpetually denied the resources it needs because others are continually favored by the scheduler or locking policy
Answers, AI explanations, and a scored voice mock interview
Sign up free to check your answers with explanations, ask the AI tutor anything on any question, and take one full AI mock interview — scored like a real panel.