Computer Science

Implementation of the First Come First Serve (FCFS) algorithm for process scheduling, calculating turn around time, wait time, and their respective averages, with and without considering arrival times.

Implementation of the Priority Scheduling algorithm for process scheduling, with and without considering arrival times (preemptive), calculating turn around time, wait time, and their respective averages.

Implementation of the Round Robin algorithm for process scheduling, with and without considering arrival times (preemptive), calculating turn around time, wait time, and their respective averages, along with functions to sort processes based on burst times.

Implementation of the Shortest Job First (SJF) algorithm for process scheduling, with and without considering arrival times (non-preemptive), calculating turn around time, wait time, and their respective averages.