Skip to content
Official PYQ · 1998

GATE CS 1998 Q1.30 — Concurrency and Synchronization

Explain with AI

When the result of a computation depends on the speed of the processes involved, there is said to be

Choose one option
View worked solution

Answer: B

A race condition is an undesirable situation that occurs when multiple concurrent processes or threads access and manipulate shared data, and the final outcome of the computation depends on the relative order or speed of their execution.

To prevent race conditions, concurrent processes must be synchronized using synchronization mechanisms like semaphores or mutexes to ensure mutual exclusion in the critical section.

Analysis of Options:

  • A. Cycle stealing: This is a hardware mechanism where a Direct Memory Access (DMA) controller temporarily takes control of the system bus from the CPU to transfer data. It has nothing to do with process synchronization or computational results.
  • B. Race condition: Correct. By definition, when the result depends on the execution speed/interleaving of processes, a race condition exists.
  • C. Time lock: This is not a standard operating system synchronization term.
  • D. Deadlock: This is a state where a set of processes are permanently blocked because each process holds a resource and waits for another resource held by another process in the set. It represents a halt in progress, not a speed-dependent computational result.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Concurrency and Synchronization questions