Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Scheduling Algorithms Quiz

Total questions: 10

Worksheet time: 8mins

Name
Class
Date
1.

What is the primary purpose of a scheduling algorithm in an operating system?

a)

A) To control memory allocation

b)

B) To allocate processor time to tasks

c)

C) To manage input/output devices

d)

D) To organize files on the disk

2.

Which scheduling algorithm divides processor time equally among all running tasks and uses time slices for each process?

a)

A) First Come, First Serve

b)

B) Shortest Job First

c)

C) Shortest Time Remaining

d)

D) Round Robin

3.

What is a disadvantage of the Round Robin scheduling algorithm as the number of processes increases?

a)

A) Longer wait times

b)

B) More efficient task execution

c)

C) Larger time slices for each process

d)

D) Decreased processor utilization

4.

In First Come, First Served scheduling, how are processes executed?

a)

A) In the order they are added to the system

b)

B) In random order

c)

C) In reverse order of arrival

d)

D) In a priority-based sequence

5.

What is the potential problem with First Come, First Served scheduling?

a)

A) High processor utilization

b)

B) Starvation of some processes

c)

C) Equal distribution of processor time

d)

D) Shortest job prioritization

6.

Which scheduling algorithm prioritizes processes based on the shortest total time needed for completion?

a)

A) Round Robin

b)

B) Shortest Time Remaining

c)

C) Shortest Job First

d)

D) Multi-level Feedback Queue

7.

What is the main benefit of the Shortest Job First scheduling algorithm?

a)

A) Reduced wait times

b)

B) Efficient distribution of processor time

c)

C) Avoiding starvation of processes

d)

D) Maximum processor utilization

8.

How does the Multi-level Feedback Queue algorithm handle task prioritization?

a)

A) Processes are assigned to queues based on their CPU usage

b)

B) Processes are executed based on their arrival order

c)

C) All processes receive equal priority

d)

D) Processes with short execution times are favoured

9.

Why is the Multi-level Feedback Queue algorithm designed to move processes between different priority queues?

a)

A) To minimize processor utilization

b)

B) To prioritize input/output tasks

c)

C) To prevent starvation and adapt to task behaviour

d)

D) To ensure that only high-priority tasks are executed

10.

What is the goal of the Multi-level Feedback Queue algorithm regarding processor time distribution?

a)

A) To prioritize long-running tasks

b)

B) To allow one high-priority task to dominate the processor's time

c)

C) To ensure that all tasks are given processor time while avoiding excessive dominance by a single task

d)

D) To allocate more processor time to input/output tasks