Multiple choice

Which of the following algorithm is best suited for dealing with live lock?

  1. FIFO

  2. Priority Based pre-emption scheduling algorithm

  3. Shortest Job first

  4. Both Shortest job and priority algorithm

  5. None of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Busy - Wait semaphore definition does not impose any ordering among waiting process, thus there is possibility that a process may be locked out due to contention with others. This process is known as live lock, thus FIFO keeps process in queue and hence no process gets starved.

Keep practicing — related questions