Scribd
Upload
12 views2 pages

Scheduling Review Questions - 032027

scheduling

Uploaded by

collinssilaa4
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

Scheduling Review Questions - 032027

scheduling

Uploaded by

collinssilaa4
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

OPERATING SYSTEM ITU 07202

CPU SCHEDULING REVIEW QUESTIONS

1. For the processes listed in following table, draw a Gantt chart illustrating their execution using:

a. First-come-First-Serve

b. Shortest-Job-First

c. Shortest-Remaining-Time-Next

d. Round-Robin (quantum=2)

e. Round-Robin (quantum=1)

Processes Arrival Time CPU Time

P1 0 3

P2 1 6

P3 4 4

P4 6 2

i. What is the average turnaround time for each algorithm?


ii. What is the Average waiting time for each Algorithm?
iii. Suggest the best scheduling Algorithm for this case and state the reasons for your choice

2. Calculate average waiting and average turnaround time of the given set of processes in table

Below using SJF and RR scheduling algorithm. [Note: Quantum time for RR=3].

Process Id Arrival Time Execution Time

1 0 8

2 2 14

3 9 19

4 19 7

5 25 15

3. How does process differ from program? Explain process state with the help of block diagram.
4. Briefly define the term scheduler in the context of any operating system. List down the
objectives of the scheduler in any operating system.
5. How can you define the term process scheduling? Differentiate between I/O bound process and
CPU bound process.
6. What are the scheduling criteria? Explain how does pre-emptive priority scheduling introduce
starvation?
7. List five criteria by which CPU scheduling may be judged, indicating in each case whether the aim
should be to minimize or maximize the criterion.
8. Which CPU scheduling algorithm suffers from the convoy effect? Explain why?
9. Explain the following terms in the context of CPU Scheduling
i. CPU utilization
ii. Throughput
iii. Turnaround time
iv. waiting time
v. Response time

10. Consider four CPU-bound processes arriving to a Shortest Remaining Time

First (SRTF) scheduler as follows:

Process Arrival Time Duration

P1 0 8

P2 3 3

P3 5 1

P4 9 4

i. Give a schedule computed by the SRTF scheduler, and compute the average waiting time
across all four processes.
ii. Explain why SRTF is difficult to implement in practice, and propose how to address this
difficulty.

You might also like