Scribd
Upload
26 views4 pages

LAB No.11: Lab Tasks Task No.01: Assuming That All Processes Arrive in The Ready Queue at The Same

This lab document outlines 3 CPU scheduling algorithms - First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin - to simulate and calculate the average turnaround time and waiting time of processes in a ready queue. It provides details on how to read the number of processes and their burst times, then simulate FCFS by serving processes in the order they arrive, SJF by serving the shortest job first, and Round Robin by allowing each process a time slice to run before preempting.

Uploaded by

dure
Copyright
© © All Rights Reserved
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
26 views4 pages

LAB No.11: Lab Tasks Task No.01: Assuming That All Processes Arrive in The Ready Queue at The Same

This lab document outlines 3 CPU scheduling algorithms - First Come First Serve (FCFS), Shortest Job First (SJF), and Round Robin - to simulate and calculate the average turnaround time and waiting time of processes in a ready queue. It provides details on how to read the number of processes and their burst times, then simulate FCFS by serving processes in the order they arrive, SJF by serving the shortest job first, and Round Robin by allowing each process a time slice to run before preempting.

Uploaded by

dure
Copyright
© © All Rights Reserved
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
You are on page 1/ 4

LAB No.

11
Lab tasks

Task no.01: Assuming that all processes arrive in the ready queue at the same
time that is arrival time for all processes is 0. Read the number of
processes/jobs in the ready queue and their respective burst/service times and
then simulate the following CPU scheduling algorithms to find the average
turnaround time and average waiting time.

a. FCFS
b. SJF
c. Round Robin

FIRST COME FIRST SERVE (FCFS)

F16SW32
ROUND ROBIN

F16SW32
F16SW32
SHORTEST JOB FIRST (SJF)

F16SW32

You might also like