Question: What is Round Robin CPU Sechduling Algorithm?

Answer: A round-robin scheduling algorithm is used to schedule the process fairly for each job a time slot or quantum and the interrupting the job if it is not completed by then the job come after the other job which is arrived in the quantum time that makes these scheduling fairly. Note: Round-robin is cyclic in nature, so starvation doesn’t occur. Round-robin is a variant of first come, first served scheduling. No priority, special importance is given to any process or task. RR scheduling is also known as Time slicing scheduling.

Example: we have three processes P₁, P₂, P₃ their burst time are 5, 4, 2 and arrival time are 0, 1, 2