7) can be used to prevent busy waiting when implementing a semaphore. A) semapho

Question

7) can be used to prevent busy waiting when implementing a semaphore. A) semaphore B) Waiting queues C) Mutex lock D) pthread join 8) How many philosophers may eat simultaneously in the Dining Philosophers problem with 5 philosophers? A) 1 B) 2 C) 3 D) 5 9) Mutual exclusion implies that: A) if a process is executing in its their critical sections B) if a process is executing in its critical section, then other processes must be execut their critical sections critical section, then no other process must be executi

Explanation / Answer

7. C. Mutex Lock:

Explanaion: Mutex Lock is the mechanism which is used to prevent busy waiting when impleenting a semaphore:

8. Option B:2

Explanation: At any given time period, max two philosophers can eat simultaneously.

9. A. If a Process is executing in its critical section, then no other process must be executing their critical section

Explanation: In the case of mutual exclusion (Mutex), one thread blocks a critical section by using locking techniques when it needs to access the shared resource and other threads have to wait to get their turn to enter into the section. This prevents conflicts when two or more threads share the same memory space and want to access a common resource.

Related Questions

Navigate

• Browse (All)
• Browse 7
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.