Java program that takes a csv file containing a list of processes, passes them to the CPU Scheduler and Round Robin algorithm, and then finally returns the statistics of the processes.

Simulation of an extended Dining Philosophers Problem where philosophers at 5 tables need two forks to eat. If deadlock occurs, one moves to a 6th table. The simulation ends when the 6th table deadlocks, identifying the last philosopher to move.