Which of the following best describes the term ‘livelock’ in the context of concurrency?
Question 2
Which of the following operations is most likely to be atomic in a typical concurrent program?
Question 3
A system has two threads that both need to access two shared resources R1 and R2. Thread A acquires R1 first, then tries to acquire R2. Thread B acquires R2 first, then tries to acquire R1. Which of the following is the most likely outcome if no synchronization mechanism is used?
Question 4
Which of the following is the most effective strategy to break a circular wait condition and avoid deadlock?
Question 5
In the context of concurrent programming, what is the main purpose of a barrier synchronization mechanism?
