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 interval from the line of submission of a process to the time of completion is termed as ____

• waiting time

• throughput

• turnaround time

• response time

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

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

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

What is Turnaround time?

• the total waiting time for a process to finish execution

• the total time spent in the ready queue

• the total time spent in the running queue

• the total time from the completion till the submission of a process

What is Waiting time?

• the total time in the blocked and waiting queues

• the total time spent in the ready queue

• the total time spent in the running queue

• the total time from the completion till the submission of a process

Round robin scheduling falls under the category of ____________

• Non-preemptive scheduling

• Preemptive scheduling

• All of the mentioned

• None of the mentioned