SLR 4 - Scheduling

What does the operating system do to a process that is currently running when it needs to switch tasks?

• It halts the process.

• It deletes the process.

• It suspends and saves the process into memory.

• It restarts the process.

In round robin scheduling, what is each time period called?

• Time segment

• Time block

• Time slice

• Time frame

Which scheduling algorithm can be compared to sharing sweets with friends?

• Multi-level feedback queue

• Shortest job first

• First come, first served

• Round robin

What is a potential downside of round robin scheduling?

• It does not ensure every task gets processor time.

• It can lead to starvation.

• It does not scale well with more processes.

• It always prioritizes longer tasks.

In first come, first served scheduling, how are processes run?

• Based on their length

• In the order they arrive

• Based on their priority

• Randomly

Which scheduling algorithm is susceptible to starvation if shorter jobs keep being added?

• Multi-level feedback queue

• Shortest job first

• Round robin

• First come, first served

How does shortest time remaining scheduling differ from shortest job first scheduling?

• It does not prioritize shorter tasks.

• It always completes longer tasks first.

• It does not use a queue.

• It prioritizes tasks with the shortest time to completion.

In a multi-level feedback queue, what happens to a process that uses too much CPU time?

• It is moved to a higher priority queue.

• It is moved to a lower priority queue.

• It is terminated.

• It is restarted.

What is the main advantage of the multi-level feedback queue algorithm?

• It ensures no single high-priority task dominates the processor's time.

• It always completes tasks in the order they arrive.

• It only runs short tasks.

• It does not use priority levels.

Which scheduling algorithm ensures that once a job starts, it will definitely complete?

• First come, first served

• Round robin

• Multi-level feedback queue

• Shortest job first