Timedora
Free Practice Quiz Question List

4 CPU Scheduling Online Quiz Questions

Use this free practice quiz with 20 questions to review 4 CPU Scheduling, test your knowledge, and prepare for your next test or exam.

20 questions
01
True or false
1 point

A thread may become ready when it is created or when it finishes waiting for an I/O event. True or false?

  1. A

    True

  2. B

    False

02
Fill in the blank
1 point

If a running thread must wait for an I/O event and cannot continue, it becomes .

03
Written response
1 point

What performance measure describes the number of jobs completed per unit of time?

04
Choose one
1 point

Under FCFS, what causes the convoy effect?

  1. A

    It estimates future CPU bursts inaccurately.

  2. B

    A long job at the front of the queue delays many short jobs.

  3. C

    It gives each thread an equal time quantum.

  4. D

    It raises the priority of tasks that have waited a long time.

05
Choose one
1 point

In Round Robin scheduling, what is a likely trade-off of using a shorter time quantum?

  1. A

    It reduces context switches and always shortens completion times.

  2. B

    It can improve first response but causes more context switches.

  3. C

    It prevents a task from being preempted.

  4. D

    It guarantees that every task meets its deadline.

06
Written response
1 point

What technique gradually raises the priority of tasks that have waited a long time, reducing the risk of starvation?

07
True or false
1 point

A scheduling policy that always runs the highest-priority ready task guarantees that every deadline will be met. True or false?

  1. A

    True

  2. B

    False

08
Choose all
1 point

Select all statements that correctly define a scheduling performance measure.

  1. A

    Turnaround time is measured from a job’s arrival until its completion.

  2. B

    Response time is measured from a job’s completion until it next waits for I/O.

  3. C

    Response time is measured from arrival until the job first gets CPU time.

  4. D

    Throughput is measured from arrival until the job first gets CPU time.

09
Fill in the blank
1 point

Shortest Remaining Time First (SRTF) is the preemptive version of .

10
Choose one
1 point

In a multilevel feedback queue, how might the scheduler treat tasks that frequently give up the CPU to wait for I/O?

  1. A

    Move them to the lowest-priority queue because they use little CPU.

  2. B

    Keep them out of all queues until their I/O finishes.

  3. C

    Favor them in a way that supports responsiveness.

  4. D

    Give them the longest CPU bursts so they finish sooner.

11
Written response
1 point

A job arrives at time 6 and completes at time 14. What is its turnaround time? Enter your answer in time units.

12
Choose all
1 point

Select all statements about fair-share scheduling that are supported by the material.

  1. A

    A fair scheduler may account for task weights or groups.

  2. B

    Fair-share scheduling requires every task to receive exactly the same CPU time.

  3. C

    EEVDF considers a task’s fair share and a virtual deadline.

  4. D

    EEVDF selects tasks using only their expected CPU burst lengths.

13
Open ended
1 point

Explain why no single CPU scheduling policy is best for every workload. Contrast one priority of interactive systems with one priority of batch systems, and identify one trade-off a scheduler designer may need to manage.

14
Choose one
1 point

A job arrives at time 3 and completes at time 11. Using completion time minus arrival time, what is its turnaround time?

  1. A

    7 time units

  2. B

    8 time units

  3. C

    11 time units

  4. D

    14 time units

15
Choose one
1 point

A running thread blocks while waiting for I/O, and another thread is ready. What can the scheduler do to keep the processor productive?

  1. A

    Keep the processor idle until the blocked thread resumes

  2. B

    Restart the blocked thread immediately

  3. C

    Run another ready thread

  4. D

    Move every waiting thread to the front of the queue

16
Choose one
1 point

Under FCFS, a 9-unit job arrives before jobs requiring 1 and 2 units. If all are ready, what scheduling problem can occur for the shorter jobs?

  1. A

    The short jobs run first because they require less CPU time

  2. B

    The short jobs wait behind the long job, producing the convoy effect

  3. C

    The scheduler interrupts the long job after each time quantum

  4. D

    The long job is postponed until all short jobs finish

17
Choose one
1 point

Three jobs are ready at the same time, with known CPU bursts of 6, 2, and 4 units. Under non-preemptive SJF, which job runs first?

  1. A

    The job requiring 6 units

  2. B

    The job requiring 4 units

  3. C

    The job requiring 2 units

  4. D

    The job that arrived most recently

18
Choose one
1 point

In Round Robin scheduling, what is the usual trade-off when the time quantum is made shorter?

  1. A

    First response generally improves, and context switches increase

  2. B

    First response worsens, and context switches decrease

  3. C

    Turnaround time is guaranteed to decrease, with no change in overhead

  4. D

    Starvation is eliminated, and context switches decrease

19
Written response
1 point

A scheduler may interrupt a running job whenever a new job becomes ready, then run whichever job has the shortest remaining expected CPU time. What algorithm is this?

20
True or false
1 point

True or false: In a preemptive operating system, the scheduler can interrupt a running thread and switch to another thread even if the running thread has not blocked or finished.

  1. A

    True

  2. B

    False