OPERATING SYTEM : UNIT – III

CLASS TEST – PROCESS SYNCHRONIZATION

1. What do you mean by cooperating process?

A cooperating process is one that can affect or be affected by other processes executing in the
system. Cooperating processes can either directly share a logical address space (that is, both code
and data) or be allowed to share data only through shared memory or message passing.

2. Define race condition.

Several processes access and manipulate the same data concurrently and the outcome of the
execution depends on the particular order in which the access takes place, is called a race
condition.

3. Define critical section.

Each process has a segment of code, called a critical section, in which the process may be
accessing — and updating — data that is shared with at least one other process.
The important feature of the system is that, when one process is executing in its critical section,
no other process is allowed to execute in its critical section. That is, no two processes are
executing in their critical sections at the same time.

4. List out the requirements that need to be satisfied to solve critical section problem.

A solution to the critical-section problem must satisfy the following three requirements:
a. Mutual exclusion. If process Pi is executing in its critical section, then no other
processes can be executing in their critical sections.
b. Progress. If no process is executing in its critical section and some processes wish to
enter their critical sections, then only those processes that are not executing in their
remainder sections can only request critical section.
c. Bounded waiting. There exists a bound, or limit, on the number of times that other
processes are allowed to enter their critical sections after a process has made a request to
enter its critical section and before that request is granted.

5. List out the categories of memory model.

a. Strongly ordered, where a memory modification on one processor is immediately visible

to all other processors.
b. Weakly ordered, where modifications to memory on one processor may not be
immediately visible to other processors.

6. What do you mean by mutex lock?

Mutex lock is used to protect critical sections and thus prevent race conditions. That is, a process
must acquire the lock before entering a critical section; it releases the lock when it exits the
critical section. The acquire() function acquires the lock, and the release() function releases the
lock.
7. Define busy waiting and its disadvantages.

While a process is in its critical section, any other process that tries to enter its critical section
must loop continuously in the call to acquire().
This continual looping is clearly a problem in a real multiprogramming system, where a single
CPU core is shared among many processes. Busy waiting also wastes CPU cycles that some
other process might be able to use productively.

Note : The term “busy waiting” is also referred as “spin-lock” as the process “spins” while
waiting for the lock to become available.

8. Define semaphore.

A semaphore S is an integer variable that, apart from initialization, is accessed only through two
standard atomic operations: wait() and signal().
Wait operation Signal operation

9. Define binary semaphore.

The value of a binary semaphore can range only between 0 and 1. Binary semaphores behave
similarly to mutex locks. Systems that do not provide mutex locks, binary semaphores can be
used instead for providing mutual exclusion.

10. Write down the usage of counting semaphore.

The value of a counting semaphore can range over an unrestricted domain. Counting
semaphores can be used to control access to a given resource consisting of a finite number of
instances.
The semaphore is initialized to the number of resources available. Each process that wishes to
use a resource performs a wait() operation on the semaphore (thereby decrementing the count).
When a process releases a resource, it performs a signal() operation (incrementing the count).

When the count for the semaphore goes to 0, all resources are being used. After that, processes
that wish to use a resource will block until the count becomes greater than 0.

PART – B

1. With the help of pseudocode, discuss the bounded buffer problem.

2. Briefly explain the readers-writers problem with necessary code.
3. With the help of a neat sketch, discuss the Dining-Philosopher problem.

(Refer my “Unit_3_Model_QA_Final” notes for the answers of part B questions)