The document explains process synchronization mechanisms including mutex locks and semaphores, which are essential for managing access to shared resources in concurrent programming. It outlines the advantages of synchronization, such as ensuring data consistency and avoiding race conditions, as well as the potential disadvantages like overhead and complexity. Additionally, it presents multiple-choice questions to test understanding of key concepts related to process synchronization.

1. PROCEESS
SYNCHRONIZA
TION

12. SYNCHRONIZATION
HARDWARE
WHEAN A PROCESS ENTERS A
CRITICAL SECTION, IT IS GIVEN A
LOCK WHICH THE PROCESS MUST
RELEASE BEFORE THE PROCESS CAN
EXIT THE CRITICAL SECTION.

13. MUTEX LOCKS
MUTEX IS A LOCKING MECHANISM
USED TO SYNCHRONIZE ACCESS TO A
RESOURCE IN THE CRITICAL SECTION.

14. SEMAPHORES
A SEMAPHORE IS A SIGNALING
MECHANISM, AND A PROCESS CAN
SIGNAL A PROCESS THAT IS WAITING
ON A SEMAPHORE.
SEMAPHORES MAKE USE OF THE
WAIT[] AND SIGNAL[] FUNCTIONS FOR
SYNCHRONIZATION AMONG THE
PROCESSES.

15. BINARY SEMAPHORES
BINARY SEMAPHORES CAN ONLY HAVE
ONE OF TWO VALUES : 0 OR 1 .

16. COUNTING
SEMAPHORES
COUNTING SEMAPHORES CAN HAVE
ANY VALUE AND ARE NOT LIMITED TO
A CERTAIN AREA.

17. COUNTING SEMAPHORES ARE
SET TO THE MAXIMUM AMOUNT
OF PROCESSES THAT CAN
ACCESS THE RESOURCE AT A
TIME.

18. ADVANTAGES
- ENSURES DATA CONSISTENCY AND INTEGRITY
- AVOIDS RACE CONDITIONS
- PREVENTS INCONSISTENT DATA DUE TO CONCURR
- SUPPORTS EFFICIENT AND EFFECTIVE USE OF SHA

19. DISADVANTAGES
- ADDS OVERHEAD TO THE SYSTEM
- CAN LEAD TO PERFORMANCE DEGRADATION
- INCREASE THE COMPLEXITY OF THE SYSTEM
- CAN CAUSE DEADLOCKS IF NOT IMPLEMENTED PR

20. THANK
YOU!

21. MULTIPLE CHOICE
1.) WHAT IS PROCESS SYNCHRONIZATION ?
A. Ensuring that only one process runs at a time.
B. Coordination of multiple processes to ensure
correct and orderly execution.
C. Scheduling processes based on their priority
levels.

22. 2.) WHICH OF THE FOLLOWING MECHANISMS CAN BE
PROCESS SYNCHRONIZATION?
A. Mutual Exclusion
B. Semaphore
C. Mutex
D. All of the above

23. 3.) WHAT IS THE PURPOSE OF MUTUAL EXCLUSION
A. Allowing multiple processes to access shared
resources simultaneously
B. Preventing multiple processes from accessing
shared resources simultaneously
C. Allowing processes to execute in any order
D. None of the above

24. 4.) WHAT IS A SEMAPHORE ?
A. A synchronization primitive that allows multiple
processes to access a shared resource
simultaneously
B. A synchronization primitive that provides a
simple integer-based mechanism for process
synchronization
C. A synchronization primitive that ensures only
one process can access a shared resource at a time
D. A synchronization primitive used for inter-

25. 5.) WHICH OF THE FOLLOWING OPERATIONS ARE
TYPICALLY SUPPORTED BY SEMAPHORES ?
A. Wait
B. Signal
C. Both Waitn and Signal
D. None of the above

26. 6.) IN THE CONTEXT OF PROCESS SYNCHRONIZATION,
WHAT IS A RACE CONDITION ?
A. A condition where multiple processes are
competing to access the CPU
B. A condition where the outcome of the execution
depends on the
relative timing of events
C. A condition where a process terminates
unexpectedly

27. 7.) WHAT IS THE ROLE OF A MUTEX IN PROCESS
SYNCHRONIZATION ?
A. It allows multiple processes to access a shared
resource simultaneously
B. It ensures that only one process can access a
shared resource at a time
C. It schedules processes based on their priority
levels

28. 8.) WHAT DISTINGUISHES BINARY SEMAPHORE FROM
COUNTING SEMAPHORE ?
A. Binary semaphore: 0 or 1, Counting semaphore:
multiple values
B. Binary semaphore: mutual exclusion, Counting
semaphore: signaling
C. Binary semaphore: mutex, Counting semaphore:
spinlocks

29. 9.) WHAT IS A FUNDAMENTAL REQUIREMENT FOR
SYNCHRONIZATION MECHANISMS TO ENSURE
CORRECTNESS IN CONCURRENT PROGRAMS ?
A. Deadlock Avoidance
B. Mutual Exclusion
C. Priority Scheduling
D. Memory Allocation

30. 10.) Which synchronization requirement ensures
that no two processes can simultaneously enter
their critical sections?
A. Atomicity
B. Fairness
C. Progress
D. Mutual Exclusion