Scribd
Upload
14 views

Module 3 QB PDF

Uploaded by

adku23ece
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Module 3 QB PDF

Uploaded by

adku23ece
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Explain the requirements to solve Critical Section Problem

2. Illustrate with an example the problem of process synchronization.

3. Outline a solution using Semaphores to solve Dining Philosopher’s Problem

4. Write the algorithm using test-and –set () instruction that satisfy all the critical section

requirements

5. Analyze the Critical section problem and modify the structure of the below given process

by applying Peterson’s solution.

6. Explain how OS distinguishes between counting semaphore and binary semaphore.

7. Explain how mutual exclusion is implemented using TestandSet() instruction and Swap()

Instruction

8. If the wait() and signal() semaphore operations are not executed atomically, then can

mutual exclusion be violated? Why or why not?

9. What are semaphores? Explain two primitive semaphore operations. What are its

advantages?

10. State Dining Philosopher’s problem and give a solution using semaphores. Write

structure of philosopher Explain the various classical synchronization problems

You might also like