1.
The purpose of Scheduling Algorithm is to maximize or
minimize the below Optimization Criteria • ___________
CPU utilization • _______ Throughput • ___________
Turnaround time • ___________ Waiting time •
___________ Response time.
2. In CPU Scheduling _________ FCFS has very long average wait
times, while ______ SJF has minimum average waiting time.
3. In CPU Scheduling, Shortest-Job-First algorithm will pick
the _________
Shortest job first, while in Priority Scheduling
algorithm will pick the job with _________ Highest priority first.
4. Priority scheduling can suffer from a major problem known
as _________________,
starvation and the solution for this is
___________.
aging
5. Round robin scheduling is similar to FCFS scheduling,
except that CPU bursts are assigned with
______________________.
Time quantum or Time Slice
6. For below Processes table, calculate the average waiting
time for the algorithms: • First Come First Serve (FCFS) •
Shortest Job First (SJF) and • Priority Scheduling
FCFS P1 P4 P5
P2 P3
SJF
Priority
7. Dispatch latency is the amount of time.
a) to execute a particular process
b) to stop one process and start another running.
c) a process has been waiting in the ready queue.
d) from when a request was submitted until the first
response is produced, not output.
8. In _________________ scheduling, the ready queue is
maintained as a circular queue.
A) FCFS B) SJF C) Priority
Scheduling D) RR
9. In Multilevel Queue scheduling, (select the most correct
choice)
A) multiple separate queues can be established
B) jobs cannot switch from queue to queue –
C) Each queue has its own scheduling algorithm
D) All the above
10. In preemptive scheduling
A) the process cannot be interrupted in the middle of the
execution
B) the CPU is allocated to the process till it terminates
C) there is no flexibility
D) the critical processes are allowed to access CPU as they
arrive itbuttypically uses criteria such as priority or time slices to decide which process to execute next,
it doesn't prioritize critical processes automatically
11. In the drawing below of the Scheduling Criteria – in
Time Axis, select the correct choice:
A) 1. Wait 2. Run 3. Response 4. Turnaround
B) 1. Run 2. Wait 3. Response 4. Turnaround
C) 1. Wait 2. Run 3. Response 4. Turnaround
D) 1. Wait 2. Run 3. Turnaround 4. Response
12. In pre-emptive scheduling, the CPU is allocated to the
process till it terminates or switches to waiting state
(waiting for I/O). A) True B) False
13. In Priority Scheduling, external priorities are assigned
by.
A) CPU B) System Programs C)
OS D) Users
14. Consider the following scheduling policy
implemented by an OS, in which a user can set numerical
priorities for processes running in the system. The OS
scheduler maintains already processes in a strict priority
queue. When the CPU is free, it extracts the ready process
with the highest priority (breaking ties arbitrarily) and runs
it until the process blocks or terminates. Which of the
following statements is/are true about this scheduling
policy?
(a) This scheduler is an example of a non-preemptive
scheduling policy.
(b) This scheduling policy can result in the starvation of
low priority processes.
(c) This scheduling policy guarantees fairness across all
active processes.
(d) This scheduling policy guarantees the lowest average
turnaround time for all processes.
15. The convoy effect occurs when longer jobs must wait
for shorter jobs. (true or false)
16. A RR scheduler may preempt a previously running job
(true or false) When the time quantum of a previous running job elapses
17. The shorter the time slice, the more a RR scheduler
gives similar results to a FIFO scheduler. (true or false)
18. For each process in each schedule above, indicate the
queue wait time. Note that wait time is the total time spend
waiting in queue (all the time in which the task is not
running).
What would be the optimal average wait time, and which of
the above three schedulers would come closest to optimal?
19. The multilevel feedback queue scheduling algorithm
allows a process to move between queues. (true/false)
20. Which module gives control of the CPU to the process
selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned.
21. The interval from the time of submission of a process to the
time of completion is termed as ____________
a) waiting time
b) turnaround time
c) response time
d) throughput.
