The document is a C program that simulates the First-Come, First-Served (FCFS) scheduling algorithm for process management. It prompts the user to input the number of processes, their IDs, and burst times, then calculates and displays the waiting time and turnaround time for each process. Finally, it computes and prints the average waiting time and average turnaround time.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
3 views2 pages
Process Scheduling Algorithm
The document is a C program that simulates the First-Come, First-Served (FCFS) scheduling algorithm for process management. It prompts the user to input the number of processes, their IDs, and burst times, then calculates and displays the waiting time and turnaround time for each process. Finally, it computes and prints the average waiting time and average turnaround time.