Intro to cs

CSC 2260 Introduction to Operating Systems Homework #3 Answer the questions below [100 points] 1. Explain what race condition is 2. Explain what critical section problem is 3. What three conditions must be satisfied in order to solve the critical section problem? 4. Explain two general approaches to handle critical sections in operating systems 5. Assume you had a function named update() that updates shared data. Illustrate how a mutex lock named mutex might be used to prevent a race condition in update(). 6. Explain what busy waiting is. 7. What is the difference between semaphore and mutex lock? 8. What is the difference between counting semaphore and binary semaphore? 9. Write two short methods that implement the simple semaphore wait() and signal() operations on global variable S. 10. Describe the dining-philosophers problem and how it relates to operating systems.