The Bounded-Buffer Problem can be solved with the help of one binary and two counting semaphores.

The Acquire and Release Lock does not satisfy MUTEX.

The FULL Semaphore in the Producer-Consumer Problem helps to overwrite the buffer when the buffer is full.

Three major requirements to solve the critical section problem are MUTEX, Progress, and Bounded Waiting.

The piece of code where a process requests to enter the critical section is called the remainder section.

The only major disadvantages of semaphores are Busy Waiting and Deadlock.

The Process Synchronization can be done at both Hardware and Software Levels.