Performance Evaluation of CPU Scheduling Algorithms $1.$ First$-$Come First$-$Served $($FCFS$)$ Non$-$Preemptive $2.$ Round Robin $($RR$)$ Preemptive $3.$ Shortest$-$Job$-$First $($SJF$)$ Non$-$Preemptive $4.$ Shortest$-$Remaining$-$Time$-$First $($SRTF$)$ Preemptive $5.$ Priority Scheduling $$ Non$-$Preemptive $6.$ Priority Scheduling $$ Preemptive Each group must contain three to four students, and each student in the group must implement one CPU algorithm from the suggested list of CPU scheduling algorithms. That is$,$ if your group consists of three students then you can choose only three CPU algorithms from the above list, and if your group consists of four students then you can choose only four CPU algorithms from the above list.