An implementation of a few Scheduling algorythms aimed at comparing their preformance. It implements First Come First Served, Round Robin, Unicode and Shortest Job First. The input is the number of processes followed by (A , B , C , D) for each process where A is the time the process comes in, B is the maximum CPU burst, C is the total running time and D is the maximum IO burst. Each process does a CPU burst, then an IO burst until it terminates. The length of the bursts is a random number between 1 and B(for CPU)/D(for IO). It is calculated as 1+(rand%B).