Livelock & Starvation — Concept Check
Questions on Livelock & Starvation. Livelock occurs when processes keep changing state in response to each other but make no progress, while starvation occurs when a process is indefinitely denied the resources it needs.
Questions in this quiz
8 questions on Livelock & Starvation — Concept Check. Work through them here, then start the quiz to answer them and see your score.
1.Two threads are repeatedly backing off and retrying to acquire a shared resource, but never succeed. What is this situation called?
- ADeadlock
- BRace condition
- CStarvation
- DLivelock
2.A low-priority thread never acquires a lock because higher-priority threads always preempt it. What is happening?
- ADeadlock
- BLivelock
- CRace condition
- DStarvation
3.In a multithreaded application, two threads back off with random sleep durations after detecting a conflict. What problem does this approach aim to solve?
- ADeadlock
- BRace condition
- CLivelock
- DStarvation
4.A system uses ReentrantLock with fairness set to true. What issue does this configuration help prevent?
- ADeadlock
- BLivelock
- CRace condition
- DStarvation
5.A low-priority thread in a Java application is gradually acquiring more CPU time over others. What mechanism is likely in use?
- ARandom backoff
- BAging
- CDeadlock prevention
- DPriority inversion
6.In a Java application, two threads repeatedly attempt to acquire the same lock and release it simultaneously. What is likely occurring?
- APriority inversion
- BStarvation
- CDeadlock
- DLivelock
7.What is a common method to prevent livelock in concurrent systems?
- ARandomized backoff
- BUsing fair locks
- CIncreasing thread priority
- DImplementing semaphores
8.In a scheduling system, a thread is never scheduled due to other threads having higher priority. What is this an example of?
- ADeadlock
- BStarvation
- CPriority inversion
- DLivelock