Day 02Part 05 – Operating system- Examples based on First come first serve basic algorithms (FCFS).

First Come, First Serve (FCFS) Scheduling – Examples & Explanation

1. Introduction to FCFS Scheduling

• First Come, First Serve (FCFS) is the simplest CPU scheduling algorithm.
• The process that arrives first gets executed first.
• It is non-preemptive, meaning once a process starts, it cannot be interrupted until it finishes.

2. Steps to Implement FCFS Scheduling

Sort processes by their arrival time (earliest first).
Execute each process in the order of arrival.
Compute the completion, turnaround, and waiting times.

3. Example of FCFS Scheduling

Given Data

Step 1: Compute Completion Time (CT)

FCFS executes processes in the order they arrive.

Step 2: Compute Turnaround Time (TAT)

$$TAT=CT-AT$$

Step 3: Compute Waiting Time (WT)

$$WT=TAT-BT$$

Step 4: Calculate Average Times

Average Turnaround Time=4+6+6+74=5.75 ms\text{Average Turnaround Time} = \frac{4 + 6 + 6 + 7}{4} = 5.75 \text{ ms}Average Turnaround Time=44+6+6+7​=5.75 ms Average Waiting Time=0+3+5+54=3.25 ms\text{Average Waiting Time} = \frac{0 + 3 + 5 + 5}{4} = 3.25 \text{ ms}Average Waiting Time=40+3+5+5​=3.25 ms

4. Gantt Chart Representation

5. Key Observations in FCFS

Simple and easy to implement.
Works well for smaller processes.
Not optimal for minimizing waiting time.
Suffers from “Convoy Effect” – when a long process delays shorter ones.

Would you like a Python/C program to simulate FCFS?

Day 02Part 05 – Operating system- Examples based on First come first serve basic algorithms (FCFS).

| P1 | P2 | P3 | P4 |
0    5    8   16   22

| P1 | P2 | P3 | P4 |
0    4    7    8   10