Algoritma Round Robin Quiz

What is Round Robin scheduling algorithm?

• Round Robin scheduling algorithm is a priority-based scheduling algorithm.

• Round Robin scheduling algorithm is a preemptive scheduling algorithm.

• Round Robin scheduling algorithm is a non-preemptive scheduling algorithm.

• Round Robin scheduling algorithm is a CPU scheduling algorithm where each process is assigned a fixed time slot in a cyclic way.

How does Round Robin scheduling algorithm work?

• Round Robin scheduling algorithm assigns a priority-based time slice to each process.

• Round Robin scheduling algorithm assigns a time slice based on the process size.

• Round Robin scheduling algorithm assigns a fixed time slice to each process in a circular manner.

• Round Robin scheduling algorithm assigns a random time slice to each process.

What is the time quantum in Round Robin scheduling?

• Fixed

• Infinite

• Dynamic

• Variable

What is the purpose of time quantum in Round Robin scheduling?

• To determine the order in which processes are executed

• To ensure that each process gets an equal share of CPU time

• To prioritize processes based on their arrival time

• To allocate a fixed amount of time for each process to execute

What happens if a process completes its time quantum in Round Robin scheduling?

• It is terminated and removed from the ready queue.

• It is given additional time quantum.

• It is moved to the front of the ready queue.

• It is preempted and moved to the back of the ready queue.

What is the advantage of Round Robin scheduling algorithm?

• Low overhead

• High throughput

• Fairness and prevention of starvation

• Efficient utilization of CPU

What is the disadvantage of Round Robin scheduling algorithm?

• Poor performance

• Difficulty in implementing

• Unfair allocation of resources

• Inefficient use of CPU

How is the waiting time calculated in Round Robin scheduling?

• By adding the arrival time to the completion time.

• By multiplying the arrival time with the completion time.

• By dividing the arrival time by the completion time.

• By subtracting the arrival time from the completion time.

What is the average waiting time in Round Robin scheduling?

• Depends on the number of processes

• Depends on the priority of each process

• Depends on the scheduling algorithm used

• Depends on the time quantum and burst time of each process

What is the turnaround time in Round Robin scheduling?

• Time taken for a process to pause

• Total time taken for a process to complete

• Time taken for a process to start

• Time taken for a process to terminate