I would like to thanks a lot for the video, even so there were still some words I could understand. However this is a great learning video assistant, no joke. Thanks
A solution to the critical-section problem must satisfy the following three requirements: 1. Mutual exclusion. If process Pi is executing in its critical section, then no other processes can be executing in their critical sections. 2. 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 participate in deciding which will enter its critical section next, and this selection cannot be postponed indefinitely. 3. 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 before that request is granted.
How Mutual Exclusion can be a solution to Critical Section Problem?? If one process is using the shared variables i.e. the critical section then other processes can't use it. That itself is the Critical Section Problem. You wrote again the same thing in Mutual Exclusion also. How it can be the solution?
