Operating System

Under direct communication, each process that wants to communicate must explicitly name the recipient or sender of the communication. This mechanism is known as ______
(i) Naming
(ii) Message Passing
(iii) Mailboxes
(iv) Chatting

Which of the following mechanisms is NOT typically used to achieve mutual exclusion?
(i) Strict alternation
(ii) Event counters
(iii) Message passing
(iv) Virtual memory

The Dining Philosopher Algorithm is a classic example of which problem?

(i) CPU scheduling
(ii) Memory fragmentation
(iii) Process synchronization and deadlock
(iv) File allocation

To avoid race condition the maximum number of processes that may simultaneously be inside the critical section is:
(i) No Limit
(ii) Two
(iii) Three
(iv) One

What is the main problem that the "Critical Section" concept aims to solve in concurrent programming?
(i) Memory overflow
(ii) Infinite loop termination
(iii) Race condition between processes
(iv) Lack of CPU resources

In Peterson's solution for two processes, which condition ensures mutual exclusion?
(i) Both processes wait infinitely
(ii) Only one process enters the critical section at a time
(iii) Both processes enter the critical section together
(iv) The process with a higher ID always wins

What do you understand by race condition?

Give few example of arising of race condition in concurrent processing.

What do you understand by critical section problem. Discuss the requirements that a solution to the critical section problem must satisfy.

(a) Define semaphore. Give a scheme for implementation of semaphore primitives.

(b) What do you mean by critical section problem? What is the solution to the critical section problem?

What is Semaphore? Explain with algorithm the Dining-Philosophers Solution using Monitors.

State producer-consumer problem. Give a solution to this problem using semaphore. Justify that your solution guarantees mutual exclusion.

Explain the Producer-Consumer problem and discuss how semaphores can be used to solve it.

Discuss critical section problem. Illustrate the classic software-based solution to this problem known as Peterson's solution.

Write an algorithm for Readers-Writers Problem solution using Semaphores.

Write short notes on: Peterson's solution