The document contains 18 questions about operating systems concepts like race conditions, semaphores, mutual exclusion, busy waiting, and the producer-consumer problem. It asks the reader to explain concepts like race conditions, semaphores, Peterson's algorithm, and the 3-state process model. It also asks whether solutions like busy waiting and Peterson's algorithm work in certain scenarios and computing models.
The document contains 18 questions about operating systems concepts like race conditions, semaphores, mutual exclusion, busy waiting, and the producer-consumer problem. It asks the reader to explain concepts like race conditions, semaphores, Peterson's algorithm, and the 3-state process model. It also asks whether solutions like busy waiting and Peterson's algorithm work in certain scenarios and computing models.
The document contains 18 questions about operating systems concepts like race conditions, semaphores, mutual exclusion, busy waiting, and the producer-consumer problem. It asks the reader to explain concepts like race conditions, semaphores, Peterson's algorithm, and the 3-state process model. It also asks whether solutions like busy waiting and Peterson's algorithm work in certain scenarios and computing models.
The document contains 18 questions about operating systems concepts like race conditions, semaphores, mutual exclusion, busy waiting, and the producer-consumer problem. It asks the reader to explain concepts like race conditions, semaphores, Peterson's algorithm, and the 3-state process model. It also asks whether solutions like busy waiting and Peterson's algorithm work in certain scenarios and computing models.
2. When a computer is being developed, it is usually first simulated by a program that runs one instruction at a time. Even multiprocessors are simulated strictly sequentially like this. Is it possible for a race condition to occur when there are no simultaneous events like this? 3. Does the busy waiting solution using the turn variable (fig.2-20) work when the two processes are running on a shared-memory multiprocessor, that is, two CPUs, sharing a common memory? 4. Does Peterson’s solution to the mutual exclusion problem shown in Fig 2-21 work when process scheduling is preemptive? How about when it is non- preemptive? 5. Consider a computer that does not have a TSL instruction but does have an instruction to swap the contents of a register and a memory word in a single indivisible action. Can that be used to write a routine enter_region such as the one found in fig. 2-22? 6. What is Semaphore? Explain their functions. 7. Give a sketch of how an operating system that can disable interrupts could implement semaphores? 8. What is the meaning of busy waiting? What others kinds of waiting are in OS? Compare each type on their applicability and relative merits. 9. Show the Peterson's algorithm preserve mutual exclusion, indefinite postponement and deadlock. 10.Does the busy waiting solution using the turn variable work when the two processes are running on the shared memory multiprocessor, that is, two CPUs sharing a common memory? 11. Compare the use of monitor and semaphore operations. 12. How does semaphore help in dinning philosopher problem. Explain. 13. Draw and describe the 3-state process model. 14.What is producer consumer problem? Explain. 15. What is the problem with thread implementation in User Space when any one of the threads gets blocked while performing IO operation. 16. “Using Semaphore is very critical for programmer” Do you support this statement? If yes prove the statement with some fact. If not, put your view with some logical facts against the statement. 17. What is critical section problem? Why executing critical section must be mutual exclusive? Explain. 18.What is producer consumer problem? Explain.
