This project is dedicated to our most beautiful professor, Ma. Ymelda C. Batalla, as part of our Midterm Laboratory Assignment. Created using HTML, CSS, and JavaScript, the website demonstrates our knowledge and application of CPU scheduling algorithms. It currently includes several scheduling algorithms: non-preemptive algorithms like First Come, First Serve (FCFS), Shortest Job First (SJF), Priority (Non-Preemptive), and Highest Response Ratio Next (HRRN), as well as preemptive algorithms such as Shortest Remaining Time First (SRTF), Priority (Preemptive), and Round Robin (RR).

To use the calculator, start by selecting the CPU scheduling algorithm you want to apply. Next, enter the number of processes and click "Generate" to bring up input fields for each process’s Arrival Time, Burst Time, and Priority (if applicable). Once you've filled in the values, click "Calculate" to view the results. The results include a table showing the Arrival Time, Burst Time, Priority Level, Completion Time, Turnaround Time, Waiting Time, Response Time, and averages for Turnaround and Waiting Times. Additionally, a Gantt Chart is provided, displaying the sequence of processes along with their start and end times.

For visual comfort, a Dark Mode option is available on the website. To activate it, simply click the Dark Mode button located at the top right corner of the page, next to the title. This feature allows you to toggle between light and dark themes, adjusting the display to your preference.