WorksheetsTopic 2: Scheduling Algorithm
Total questions: 11
Worksheet time: 6mins
Which type of CPU Scheduling handles processes based on the arrival order?
First-Come, First-Served
Shortest-Job-First
Round Robin
Priority
Which is referred as total amount of time a process has been waiting in the ready queue?
Throughput
Turnaround time
Response time
Waiting time
Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
First-Come, First-Served Scheduling
Shortest Job Scheduling
Priority Scheduling
none of the mentioned
In priority scheduling algorithm ____________
CPU is allocated to the process with highest priority
CPU is allocated to the process with lowest priority
Equal priority processes can not be scheduled
None of the mentioned
Which algorithm is defined in Time quantum?
Shortest Job First
Round Robin
Priority
Multilevel Queue
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
Multilevel Queue 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
Multilevel queue scheduling
Which of these is a benefit of FCFS
Simple to implement
It considers priority
Long jobs will get completed eventually
What is FIFO algorithm?
first executes the job that came in last in the queue
first executes the job that came in first in the queue
first executes the job that needs minimal processor
first executes the job that has maximum processor needs
