Scribd
Upload
1 views

Submitted T1

This lab report, submitted by Md. Parvej Hasan for the Operating System Lab course, presents a study on the Shortest Job First (SJF) non-preemptive scheduling algorithm. It includes a Gantt chart and a table detailing the CPU burst time, arrival time, completion time, turnaround time, waiting time, and response time for five processes. The report concludes with average turnaround and waiting times of 9.80 and 5.20, respectively.

Uploaded by

rakibrafin999
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

Submitted T1

This lab report, submitted by Md. Parvej Hasan for the Operating System Lab course, presents a study on the Shortest Job First (SJF) non-preemptive scheduling algorithm. It includes a Gantt chart and a table detailing the CPU burst time, arrival time, completion time, turnaround time, waiting time, and response time for five processes. The report concludes with average turnaround and waiting times of 9.80 and 5.20, respectively.

Uploaded by

rakibrafin999
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Lab Report-2

Submitted To :

Mohammad Anwar Hossain


Lecturer
Dept. of CSE
World University of Bangladesh

Submitted By :
Md. Parvej Hasan
ID No : 3782
Batch : 63A
Department : CSE
Course Name: Operating System Lab
Course Code : CSE06133136

Date of Submission : 10th February 2025


Given That ,

Process CPU Burst Time Arrival Time


P1 6 2
P2 2 5
P3 8 1
P4 3 0
P5 4 4

SJF non-preemtive Scheduling Algorithm.

• Gantt chart:

P4 P1 P2 P5 P3
0 3 9 11 15 23

Process CPU Burst Arrival Time Completion Turn Around Waiting Response
Time (CT) (AT) Time (CT) Time (TAT) Time (WT) Time (RT)
P1 6 2 9 7 1 1
P2 2 5 11 6 4 4
P3 8 1 23 22 14 14
P4 3 0 3 3 0 0
P5 4 4 15 11 7 7

• Turn Around Time Average: 9.80


• Waiting Time Average: 5.20
• C programming code
• C programming code output

You might also like