For example, If two students want to use a printer, there will be data inconsistencies. A very good solution is to use Peterson's algorithm.Peterson's algorithm (or Peterson's solution) is a concurrent programming algorithm for mutual exclusion that allows two or more processes to share a single-use resource without conflict, using only shared memory for communication. While Peterson's original formulation worked with only two processes, the algorithm can be generalized for more than two.
And the code of the example is as fllow: