wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

CPU scheduling

Total questions: 16

Worksheet time: 12mins

Name
Class
Date
1.

What scheduling algorithm assigns the CPU

to the process with the highest priority?

a)

FIFO

b)

SJF non preemptive

c)

SJF preemptive

d)

priority

2.

Which Scheduling algorithm allocates the

CPU first to the process that requests CPU first?

a)

First Come First serve scheduling

b)

shortest job scheduling

c)

priority scheduling

d)

none of the mentioned

3.

The interval from the line of submission of a process to the time of completion is termed as ____

a)

waiting time

b)

throughput

c)

turnaround time

d)

response time

4.

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called:

a)

job queue

b)

ready queue

c)

execution queue

d)

process queue

5.

In priority scheduling algorithm:

a)

CPU is allocated to the process with highest priority

b)

CPU is allocated to the process with lowest priority

c)

equal priority processes can not be scheduled

d)

none of the mentioned

6.

CPU scheduling is the basis of ___________

a)

multiprocessor systems

b)

multiprogramming operating systems

c)

larger memory sized systems

d)

none of the mentioned

7.

Scheduling is done so as to ____________

a)

increase CPU utilization

b)

decrease CPU utilization

c)

keep the CPU more idle

d)

none of the mentioned

8.

What is Turnaround time?

a)

the total waiting time for a process to finish execution

b)

the total time spent in the ready queue

c)

the total time spent in the running queue

d)

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

9.

What is Waiting time?

a)

the total time in the blocked and waiting queues

b)

the total time spent in the ready queue

c)

the total time spent in the running queue

d)

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

10.

Round robin scheduling falls under the category of ____________

a)

Non-preemptive scheduling

b)

Preemptive scheduling

c)

All of the mentioned

d)

None of the mentioned

11.

What is Scheduling?

a)

allowing a job to use the processor

b)

making proper use of processor

c)

all of the mentioned

d)

none of the mentioned

12.

In multilevel feedback scheduling algorithm ____________

a)

a process can move to a different classified ready queue

b)

classification of ready queue is permanent

c)

processes are not classified into groups

d)

none of the mentioned

13.

Which one of the following can not be scheduled by the kernel?

a)

kernel level thread

b)

user level thread

c)

process

d)

none of the mentioned

14.

Process are classified into different groups in ____________

a)

shortest job scheduling algorithm

b)

shortest job scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

15.

Which algorithm is defined in Time quantum?

a)

shortest job scheduling algorithm

b)

round robin scheduling algorithm

c)

priority scheduling algorithm

d)

multilevel queue scheduling algorithm

16.

In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________

a)

all process

b)

currently running process

c)

parent process

d)

init process