Chapter 2 – Exercises

1. APPLY THE CPU SCHEDULING ALGORITHMS: FCFS, NON-PREEMPTIVE STF, SRTF

(PREEMPTIVE STF), ROUND-ROBIN (WITH TIME QUANTUM=12) FOR FOLLOWING
QUEUES.

1.1 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF DURATION P1 (45),
P2(23), P3(10), P4(3), P5(17)

1.2 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF DURATION P1 (4), P2(45), P3(5), P4(33),
P5(71)

1.3 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF DURATION P1 (49), P2(45), P3(15),
P4(73)

(Trong các bài đề bài không đề cập đến thời gian xuất hiện thì hiểu là thời gian xuất hiện cùng là 0)
2. APPLY THE CPU SCHEDULING ALGORITHMS: FCFS, NON-PREEMPTIVE STF, SRTF
(PREEMPTIVE STF), ROUND-ROBIN (WITH TIME QUANTUM=15) FOR FOLLOWING
QUEUES.

2.1 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF (ARRIVAL TIME,
DURATION) P1 (0, 45), P2(3, 23), P3(8, 10), P4(12, 3), P5(40, 17)

2.2 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF (ARRIVAL TIME, DURATION) P1
(0, 4), P2(5, 45), P3(8, 5), P4(10, 33), P5(15, 71)

2.3 GIVEN THE LIST OF THE PROCESSES IN THE FOLLOWING QUEUE IN THE FORM OF (ARRIVAL TIME, DURATION) P1
(0, 49), P2(17, 45), P3(20, 15), P4(31, 73)

3 EVALUATE THE ABOVE ALGORITHMS WITH THE METRICS: THROUGHPUT,

TURNAROUND TIME, RESPONSE TIME, WAITING TIME AS WELL AS THEIR AVERAGE
VALUES

2
3