{"id":11420,"date":"2022-12-26T12:14:26","date_gmt":"2022-12-26T12:14:26","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=11420"},"modified":"2023-05-11T13:14:04","modified_gmt":"2023-05-11T13:14:04","slug":"fcfs-scheduling-program-in-c","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/fcfs-scheduling-program-in-c\/","title":{"rendered":"FCFS Scheduling Program in C"},"content":{"rendered":"

\"\"<\/p>\n

In this article, we will look at FCFS, which stands for First Come First Serve Scheduling Algorithm. Furthermore, we will understand how the scheduling algorithm works as well as code it from scratch, and terminologies related to the First Come, First Serve Scheduling Algorithm will be discussed. In interviews, FCFS is one of the most frequently asked questions about Operating Systems topics. Students can answer any conceptual question in interviews by focusing on the code and algorithm used in this article on the FCFS Scheduling Program in C.<\/p>\n

What is FCFS Scheduling?<\/h2>\n

The CPU assigns tasks using a non-preemptive scheduling algorithm called First Come, First Serve. As the name implies, it prioritizes tasks based on the request that was made first.
\nNo preemption ensures that no job takes over a job that is already in progress, and the processes are executed in a queue-like fashion.<\/p>\n

Queues can be a viable data structure to assume the function of people at the end going out and entering from the back, waiting for their turn. Similarly, when a process requires CPU, it is placed at the end of the queue, and each process is completed one at a time, leaving the queue from the front until no processes remain and the queue is empty.<\/p>\n

When idle, the CPU is assigned to the queue’s head, and when the process enters the FIFO queue, the PCB is attached to the queue’s tail.<\/p>\n

Terminologies Related to FCFS<\/h3>\n
    \n
  1. \n

    Burst Time –<\/strong> The total time elapsed to execute a process is known as burst time.<\/p>\n<\/li>\n

  2. \n

    Turnaround Time –<\/strong> The summation of waiting time and burst time results in turnaround time. It is the total time that a process takes right after its arrival in the queue.<\/p>\n

    Turnaround Time = Waiting Time + Burst Time<\/code><\/pre>\n<\/li>\n
  3. \n
    Waiting Time –<\/strong> The difference between the Start Time and Arrival Time can be classified as the waiting time.<\/p>\n<\/li>\n
  4. \n
    Average Waiting Time<\/strong> – The sum of all the waiting times by the total number of processes can be stated as Average Waiting Time.<\/p>\n<\/li>\n<\/ol>\n
    Dry Run of FCFS Program in C using an Example<\/h3>\n
    \"\"<\/p>\n
    Suppose there is a process queue, Process A enters at first with a burst time of 5 seconds. Process B enters at 3rd second with a burst time of  6 seconds. Process C enters at 8th second with a burst time of 2 seconds.<\/p>\n
    \"\"<\/p>\n
    \"\"<\/p>\n
    Process A will finish at 5th second and Process B will be assigned CPU at 5th second. After 2 seconds of waiting in the queue, it will finish its execution at 11th second.<\/p>\n
    \"\"<\/p>\n
    If Process B completes at the 11th second and Process C enters the queue at the 8th second, the waiting time can be calculated by subtracting the arrival time, i.e. 8, from the starting time, i.e. 11, which equals 3 seconds.<\/p>\n
    \"\"<\/p>\n
    Process C is completed at the 13th second because its burst time is 2 seconds.<\/p>\n
    \"\"<\/p>\n
    Pseudocode of the FCFS Scheduling Algorithm<\/h3>\n
      \n
    • Create a queue to get the requests or processes that must be stored to execute.<\/li>\n
    • On the arrival of a new process, it is placed at the end of the queue.<\/li>\n
    • If the CPU is idle, assign the request or process at the front of the queue to the CPU for processing.<\/li>\n
    • But in case the CPU is busy, wait until the current process is finished processing.<\/li>\n
    • As the execution of the current process is done, it is removed from the FIFO queue, and the next process at the front of the queue is put forward for execution.<\/li>\n
    • Repeat steps 3 to 5 until all processes have been serviced.<\/li>\n<\/ul>\n
      Code Implementation of FCFS Program in C<\/h3>\n
      The preceding heading, Algorithm to FCFS Scheduling Program in C, explains how to create the FCFS Scheduling program.<\/p>\n\t\t\t\t\t\t