Process Scheduling Simulation

Data Structures (CS-218) Semester Project | Fall 2020

A graphical simulation of some popular CPU Scheduling Algorithms using the most appropriate data structures. This Process Scheduling Simulator allows you to visualize how each scheduling algorithm ensures maximum throughput, minimum process response time, waiting time and turnaround time.

Screenshots

List of CPU Scheduling Algorithms Implemented

• First Come First Serve
• Shortest Job First
• Round Robin
• Shortest Remaining Time First
• Non Preemptive Priority Scheduling

List of Data Structures Used

• Priority Queue (Implemented with a Linked List)
• Queue (Implemented with a Linked List)
• Dynamic Safe Array
• Linked List