Synchronization, CPU Scheduling
Use of AI is extremely prohibited and will lead to failure of this course!
Research and explain the dining philosophers problem in your own words and how this can be corrected.
In a table highlight the differences between semaphores, monitors, mutexes and locks. Give examples in code of your choosing to clearly explain these differences in a separate column of this table titled (“Code Sample”). You are free to choose the format of the table as long as it is unique and your own.
Given the following processes and their burst times, priority and arrival times, show the average wait time and Turnaround time using FCFS and Round robin CPU scheduling algorithms.
Given the following processes and their burst times, priority and arrival times, show the average wait time and Turnaround time using pre-emptive and non-preemptive priority CPU scheduling.
Submit a pdf with your answers (show all calculations).
