In what cases can a race condition occur in multithreaded programming?

A race condition in multithreaded programming occurs when multiple threads access and modify shared data simultaneously without proper synchronization. This leads to unpredictable results, as the order of operations can vary.

For example, if two threads simultaneously increment a shared counter, the final value may be less than expected because read and write operations overlap.

To prevent race conditions, synchronization mechanisms such as locks, semaphores, mutexes, and other primitives are used to ensure sequential access to shared resources.