Project Preliminaries Module Week 5

WORKSHEET ACTIVITY/IES:

Student’s Name: Jayvee Bugay Score:

Year and Section: BSIT-2A Date:

Answer the following questions on the spaces provided.

Reference – Check NESO Academy on youtube.com

1. Using Priority Scheduling, in what order would jobs be processed?

a. Compute for Waiting Time for each Jobs and AWT

Jobs Burst Time Priority

Job A 10 3
Job B 1 1
Job C 2 4
Job D 1 5
Job E 5 2

Job B Job E Job A Job C Job D

0 1 6 16 18
19

Process Waiting time

Job B 0
Job E 1
Job A 6
Job C 16
Job D 18

AWT= 41/2= 20.5

1. The order will be Job B, Job E, Job A, Job C, Job D.

 2. Using Priority Scheduling, in what order would jobs be processed?
a. Compute for Waiting Time for each Jobs and AWT

Jobs Burst Time Priority

Job A 11 1
Job B 7 5
Job C 5 3
Job D 3 2
Job E 8 4

Job A Job D Job C Job E Job B

0 11 14 19 27
34

PROCESS WAITING TIME

Job A 0
Job D 11
Job C 14
Job E 19
Job B 27

AWT= 71/2= 35.5

2. The order will be Job A, Job D, Job C, Job E, Job B.

3. Using Round Robin, in what order would jobs be processed?

a. Compute for ATAT and AWT
Note: If CPU is Round Robin with TQ = 2 units

Jobs Burst Time Arrival Time

 Job A 5 0
Job B 3 1
Job C 1 2
Job D 2 3
Job E 3 4

Job A Job B Job C Job D Job E Job A Job B Job E Job A

0 2 4 5 7 9 11 12 13
14

3. The order will be Job A, Job B, Job C, Job D, Job E, Job A, Job B, Job E, Job A.

JOBS WAITING TIME TURN AROUND TIME

Job A 9 14
Job B 8 11
Job C 2 3
Job D 2 4
Job E 8 11

ATAT= 14+11+3+4+11=43/5= 8.6

AWT= 9+8+2+2+8= 29/5 = 5.8

4. Using Round Robin, in what order would jobs be processed?

a. Compute for ATAT and AWT
Note: If CPU is Round Robin with TQ = 4 units

Jobs Burst Time Arrival Time

Job A 5 0
Job B 7 1
 Job C 3 2
Job D 10 3
Job E 8 4
Job Job B Job C Job D Job E Job A Job B Job D Job E Job D
A
0 4 8 11 15 19 20 23 27 31
33

4. The order will be Job A, Job B, Job C, Job D, Job E, Job A, Job B, Job D, Job E, Job D.

JOBS WAITING TIME TURN AROUND TIME

Job A 15 20
Job B 15 22
Job C 6 9
Job D 20 30
Job E 19 27

ATAT = 20+22+9+30+27= 108/5 = 21.6

AWT = 15+15+6+20+19= 75/5 = 15

5.
 Note: CPU Cycle = Burst Time

Calculate which jobs will have arrived ready for processing by the time the first job is
finished or first interrupted using each of the following scheduling algorithms.
a. FCFS
b. SJN
c. Round Robin (use a time quantum of 5, but ignore the time required for context
switching and natural wait)
d. Priority Scheduling Values Job A = 3, Job B= 1, Job C = 4, Job D = 2, Job E = 5

A.
Job A Job B Job C Job D Job E
0 15 17 31 41
42

B.
Job E Job B Job D Job C Job A
0 1 3 13 27
42

C.
Job A Job B Job C Job D Job E Job A Job C Job D Job A Job C
0 5 7 12 17 18 23 28 33 38
42

D.
Job B Job D Job A Job C Job E
0 2 12 27 41
42