WorksheetsResource Management
Total questions: 25
Worksheet time: 17mins
What scheduling algorithm assigns the CPU
to the process with the highest priority?
FIFO
SJF non preemptive
SJF preemptive
priority
Which Scheduling algorithm allocates the
CPU first to the process that requests CPU first?
First Come First serve scheduling
shortest job scheduling
priority scheduling
none of the mentioned
The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:
job queue
ready queue
execution queue
process queue
CPU scheduling is the basis of ___________
multiprocessor systems
multiprogramming operating systems
larger memory sized systems
none of the mentioned
Scheduling is done so as to ____________
increase CPU utilization
decrease CPU utilization
keep the CPU more idle
none of the mentioned
Which algorithm is defined in Time quantum?
shortest job scheduling algorithm
round robin scheduling algorithm
priority scheduling algorithm
multilevel queue scheduling algorithm
Once the CPU has been allocated to a process, the process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state.
Nonpreemptive Scheduling
Preemptive Scheduling
Nonpreemptive & Preemptive Scheduling
None of the above
In this, the process that comes first will be executed first and next process starts only after the previous gets fully executed.
First-come, first-serve
Shortest-job-first scheduling
Round-robin scheduling
Priority scheduling
This is scheduling policy that selects for execution the waiting process with the smallest execution time.
First-come, first-serve
Shortest-job first scheduling
Round-robin scheduling
Priority scheduling
It is a CPU Scheduling algorithm where each process is assigned a fixed time slot in a cyclic way.
First-come, first-serve
Shortest-job-first scheduling
Round-robin scheduling
Priority scheduling
What scheduling algorithm does Windows, Mac OS X, Linux, and UNIX are using?
Nonpreemptive scheduling
Preemptive scheduling
First-come,first-serve scheduling
Round robin scheduling
What kind of chart is being used to illustrate scheduling?
Gantt Chart
Line Chart
Doughnut Chart
In multilevel feedback scheduling algorithm:
a process can move to a different classified ready queue
classification of ready queue is permanent
processes are not classified into groups
none of the mentioned
A process is selected from the ______ queue by the ________ scheduler, to be executed.
blocked, short term
wait, long term
ready, short term
ready, long term
Process are classified into different groups in
shortest job scheduling algorithm
round robin scheduling algorithm
priority scheduling algorithm
multilevel queue scheduling algorithm
Assuming the above process being scheduled with the SJF scheduling algorithm:
The waiting time for process D is 3 ms.
The waiting time for process D is 0 ms.
The waiting time for process D is 16 ms.
The waiting time for process D is 9 ms.
What is the average waiting time for all of these processes with the SJF scheduling algorithm?
10.25 ms
7 ms
7.75 ms
10 ms
Which of the following scheduling algorithms gives minimum average waiting time?
FCFS
SJF
Round Robin
Priority
This is scheduling policy that selects for execution the waiting process with the smallest execution time.
First-come, first-serve
Shortest-job first scheduling
Round-robin scheduling
Priority scheduling
Multilevel queue scheduling
Which of these is a benefit of FCFS
Simple to implement
It considers priority
Long jobs will get completed eventually
Which is not a process state?
waiting
terminated
blocked
redirected
Choose TWO (2) conditions for deadlock to arise.
mutual exclusion
medium term
resource hierarchy
circular wait
Choose THREE (3) methods to overcome deadlock situation.
serializing token
resource hierarchy solution
no preemption
lock free & wait free algorithm
mutual exclusion
