Scribd
Upload
96 views

OS MSIT Assignment 1

This document contains the computation and analysis of job scheduling algorithms First Come First Serve (FCFS), Shortest Job First (SJF), and Non-Preemtive Priority (NPP) on five jobs (J1-J5). It provides the Gantt charts, turnaround times, waiting times, average times, and CPU utilization for each algorithm applied to the same set of jobs. The CPU utilization is 100% for all three algorithms.

Uploaded by

Debbie Banzales
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
96 views

OS MSIT Assignment 1

This document contains the computation and analysis of job scheduling algorithms First Come First Serve (FCFS), Shortest Job First (SJF), and Non-Preemtive Priority (NPP) on five jobs (J1-J5). It provides the Gantt charts, turnaround times, waiting times, average times, and CPU utilization for each algorithm applied to the same set of jobs. The CPU utilization is 100% for all three algorithms.

Uploaded by

Debbie Banzales
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

Assignment 1 in MSIT: OPERATING SYSTEM

Prepared by: MARIO S BANZALES

COMPUTATION OF First Come First Serve

Given: Job At Bt Priority


J1 0 13 4
J2 3 5 3
J3 8 4 5
J4 15 6 1
J5 17 9 2

Gantt Chart: J1 J2 J3 J4 J5

0 3 8 15 17

J1 13 J2 5 J3 4 J4 6 J5 9
0 13 18 22 28 37

% CPU Utilization = (37/37)x100 = 1 x 100 = 100%

ttJ1 = 13 – 0 = 13 wtJ1 = 13 – 13 = 0
ttJ2 = 18 – 3 = 15 wtJ2 = 15 – 5 = 10

ttJ3 = 22 – 8 = 14 wtJ3 = 14 – 4 = 10
ttJ4 = 28 – 15 = 13 wtJ4 = 13 – 6 = 7
ttJ5 = 37 – 17 = 20 wtJ5 = 20 – 9 = 11
ttave. = (75/5) = 15 wtave. = (38/5) = 7.6

1
Assignment 1 in MSIT : OPERATING SYSTEM

Prepared by: MARIO S BANZALES

COMPUTATION OF Short Job First

Given: Job At Bt Priority


J1 0 13 4
J2 3 5 3
J3 8 4 5
J4 15 6 1
J5 17 9 2

Gantt Chart: J1 J2 J3 J4 J5

0 3 8 15 17

J1 13 J3 4 J2 5 J4 6 J5 9
0 13 17 22 28 37

% CPU Utilization = (37/37)x100 = 1.x 100 = 100%

ttJ1 = 13 – 0 = 13 wtJ1 = 13– 13 = 0


ttJ2 = 17 – 3 = 14 wtJ2 = 14 – 5 = 9

ttJ3 = 22 – 8 = 14 wtJ3 = 14 – 4 = 10
ttJ4 = 28 – 15 = 13 wtJ4 = 13 – 6 = 7
ttJ5 = 37 – 17 = 20 wtJ5 = 20 – 9 = 11
ttave. = (74/5) = 14.8 wtave. = (37/5) = 7.4

2
Assignment 1 in MSIT : OPERATING SYSTEM

Prepared by: MARIO S BANZALES

COMPUTATION OF Non Pre-Emptive Priority

Given: Job At Bt Priority


J1 0 13 4
J2 3 5 3
J3 8 4 5
J4 15 6 1
J5 17 9 2

Gantt chart: J1 J2 J3 J4
J5

0 3 8 15 17

J1 13 J4 6 J5 9 J2 5 J3 4
0 13 19 28 33 37

% CPU Utilization = (37/37)x100 = 1.x 100 = 100%

ttJ1 = 13 – 0 = 13 wtJ1 = 13 – 13 = 0
ttJ2 =1 9 – 3 = 16 wtJ2 = 16 – 5 = 11

ttJ3 = 28 – 8 = 20 wtJ3 = 20 – 4 = 16
ttJ4 = 33 – 15 = 18 wtJ4 = 18 – 6 = 12
ttJ5 = 37 – 17 = 20 wtJ5 = 20 – 9 = 11
ttave. = (87/5) = 17.4 wtave. = (50/5) = 10

You might also like