Unsolved Questions on CPU Scheduling Algorithms

Solve these Unsolved Questions on CPU Scheduling Algorithms to check out your understanding on the same

Q1. Find the av. waiting time and av. turnaround time using:
a) FCFS
b) SJF(NP)
c) SJF(P)
d) RR (TQ=3)

ProcessBurst TimeArrival Time
P122
P265
P340
P470
P547

Q2. Find the av. waiting time and av. turnaround time using:
a) SJF(NP)
b) SJF(P)

PROCESSBURST TIMEARRIVAL TIME
P132
P250
P331
P446

Q3. Find the av. waiting time and av. turnaround time using:
a) Priority(NP)
b) Priority(P)

PROCESSBURST TIMEARRIVAL TIMEPriority
P1321
P2503
P3312
P4461

Q1. [GATE-2006] Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.
(a) 1 (b) 2 (c) 3 (d) 4

Q2. [GATE-2006] Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by giving priority to the process with the lowest process id. The average turn around time is:
(a) 13 units (b) 14 units (c) 15 units (d) 16 units

Q3. [GATE-2007] An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:

Process   Execution time    Arrival time
P1               20                         0
P2               25                         15
P3               10                         30
P4               15                         45

What is the total waiting time for process P2?
(a) 5 (b) 15 (c) 40 (d) 55

Relevant Links

25 thoughts on “Unsolved Questions on CPU Scheduling Algorithms

Leave a Reply

Your email address will not be published. Required fields are marked *