[Solved] Given the following pseudocode where two threads increment a shared variable count without synchronization:Thread 1: temp = count temp = temp + 1 count = temp Thread 2:... | LLD

LLD - Design — Parking Lot System

Given the following pseudocode where two threads increment a shared variable count without synchronization:

Thread 1: temp = count
          temp = temp + 1
          count = temp

Thread 2: temp = count
          temp = temp + 1
          count = temp

If count starts at 0, what is a possible final value after both threads execute once?

A1

B2

C0

D3

Step-by-Step Solution

Solution:

Step 1: Understand race condition
Both threads read count as 0 before incrementing.
Step 2: Overwrite issue
Each thread increments locally and writes back, but one write overwrites the other.
Step 3: Possible final values
Instead of 2, the final count can be 1 due to lost update.
Final Answer:
1 -> Option A
Quick Check:
Race conditions cause lost increments [OK]

Quick Trick: Unsynchronized increments can lose updates [OK]

Common Mistakes:

MISTAKES

Master "Design — Parking Lot System" in LLD

9 interactive learning modes - each teaches the same concept differently

More LLD Quizzes

Given the following pseudocode where two threads increment a shared variable count without synchronization: