Question: q1. Consider a program which creates three threads and uses one of them to display A, another for B, and the last for C in
q1.
| Consider a program which creates three threads and uses one of them to display "A", another for "B", and the last for "C" in the same console window. No synchronization occurs. Does this program contain a race condition? Explain. |
q2
How does supporting mutual exclusion, progress, and bounded wait time determine the effectiveness of a solution for the critical section problem? Explain.
q3
Explain why most of the time writing data (in parallel processing) is done within a critical section.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
