The aim of the lab assignment is to write a program in C that simulates the First Come First Serve (FCFS) CPU scheduling algorithm. FCFS is a non-preemptive scheduling algorithm where the process that requests the CPU first is allocated the CPU first before other processes. The program should accept process details like arrival time and burst time, and then simulate allocating the CPU to processes based on their arrival time, with no preemption.
The aim of the lab assignment is to write a program in C that simulates the First Come First Serve (FCFS) CPU scheduling algorithm. FCFS is a non-preemptive scheduling algorithm where the process that requests the CPU first is allocated the CPU first before other processes. The program should accept process details like arrival time and burst time, and then simulate allocating the CPU to processes based on their arrival time, with no preemption.
The aim of the lab assignment is to write a program in C that simulates the First Come First Serve (FCFS) CPU scheduling algorithm. FCFS is a non-preemptive scheduling algorithm where the process that requests the CPU first is allocated the CPU first before other processes. The program should accept process details like arrival time and burst time, and then simulate allocating the CPU to processes based on their arrival time, with no preemption.