Round Robin Program In C Mcq Exercise 2

• ✅ To prevent some processes from taking control of the CPU time and excluding other processes.
• ✅ To also reduces the time taken to complete the set goals.
• ✅ To fully utilize the CPU.

Explanation:

The correct answer is option (b). Round-robin scheduling also benefits all processes because it ensures that every process gets the same amount of CPU time in a particular round.

1. What is a context switch for round-robin scheduling?

• ✅ The transformation of a process from executing to waiting.
• ✅ Change-over from one process to another
• ✅ Memory management is the division of memory in a system to a process
• ✅ The bringing to an end of something:

Explanation:

The correct answer is option (b). A context switch is the act of saving and reloading the information about the execution of a particular CPU to allow several processes to run in the same CPU.

1. Which of the following can be considered a disadvantage of Round Robin scheduling?

• ✅ methods of high priority may be deprived
• ✅ The processes may be queued for relatively long periods before getting CPU
• ✅ It has high overhead in that the system frequently switches between contexts.
• ✅ It cannot cope with varying priorities of the processes to be executed.

Explanation:

The correct answer is option (c). In Round-Robin scheduling, there appear to be many context switches, which increase the system's overhead and decrease its efficiency.

1. How does the very small time quantum affect round-robin scheduling?

• ✅ It means there will be a lesser number of context switching.
• ✅ It works the same way as the First Come First serve queuing system
• ✅ It is associated with more context switches
• ✅ It improves throughput

Explanation:

The correct answer is option (c). A very small time quantum leads to more context switches, which decreases system performance.

1. Choose accurate and correct statements on Round Robin's scheduling.

• ✅ It is a CPU scheduling algorithm that uses the non-preemptive technique.
• ✅ It favors short workloads
• ✅ It always reduces the time taken for waiting.
• ✅ It is used in preemptive scheduling techniques.

Explanation:

The accurate choice is alternative (d). Round Robin operates as a preemptive scheduling algorithm allowing processes to be halted upon reaching the time quantum limit.