The document discusses different CPU scheduling algorithms used by an operating system's process scheduler to assign processes to the CPU. It describes First-Come, First-Served (FCFS) scheduling, Shortest-Job-First (SJF) scheduling, Round Robin (RR) scheduling, and Multiple-Level Queues scheduling. It also defines key timing metrics for processes like arrival time, completion time, burst time, turnaround time, and waiting time. FCFS scheduling follows the principle of processing processes in the order of their arrival in the ready queue on a first-come, first-served basis.

1. OPERATING SYSTEM
CPU Scheduling Algorithm

2. CPU Scheduling Algorithm
• A Process Scheduler schedules different processes to be assigned to
the CPU based on particular scheduling algorithms.
• Types.
• First-Come, First-Served (FCFS) Scheduling
• Shortest-Job-First (SJF) Scheduling
• Round Robin (RR) Scheduling
• Multiple-Level Queues Scheduling
• Multi-level Feedback Scheduling

3. Below is the different time with respect to a process.
Arrival Time: Time at which the process arrives in the ready
queue.
Completion Time: Time at which process completes its execution.
Burst Time: Time required by a process for CPU execution.
Turn Around Time: Time Difference between completion time
and arrival time.
Turn Around Time = Completion Time – Arrival Time
Waiting Time (W.T): Time Difference between turn around time
and burst time.
Waiting Time = Turn Around Time – Burst Time

4. First-Come, First-Served (FCFS) Scheduling

5. THANK YOU..
Dr.Thenmozhi K
thenmithu@gmail.com