5. Operating Systems

Concurrency — Quiz

Test your understanding of concurrency with 5 practice questions.

Practice Questions

Question 1

Which of the following concurrent programming patterns is most suitable for scenarios where multiple threads need to perform independent computations on different segments of a large dataset, and then combine their results?

Question 2

Consider a system with $N$ processes and $M$ identical resources. If each process requires at most $K$ resources, what condition must be met to guarantee that deadlock will not occur, assuming $N \cdot (K-1) < M$?

Question 3

In a concurrent system, what is the primary purpose of a memory barrier (or memory fence)?

Question 4

Which of the following statements accurately describes the concept of linearizability in concurrent data structures?

Question 5

Consider a scenario where a shared resource is protected by a mutex. If a thread attempts to acquire the mutex while holding another resource, and the mutex it's waiting for is held by another thread that is waiting for the first thread's resource, what specific condition for deadlock is being met?