Operating Systems | CPU Scheduling | Question 5

If the quantum time of round robin algorithm is very large, then it is equivalent to:
(A) First in first out
(B) Shortest Job Next
(C) Lottery scheduling
(D) None of the above

Answer: (A)
Explanation: If time quantum is very large, then scheduling happens according to FCFS.
Quiz of this Question

Article Tags :

Operating Systems Questions

Operating Systems-CPU Scheduling

Recommended Articles

1. Operating Systems | CPU Scheduling | Question 1

2. Operating Systems | CPU Scheduling | Question 2

3. Operating Systems | CPU Scheduling | Question 3

4. Operating Systems | CPU Scheduling | Question 4

5. Operating Systems | CPU Scheduling | Question 6

6. Operating Systems | CPU Scheduling | Question 7

7. CPU Scheduling in Operating Systems using priority queue with gantt chart

8. CPU Scheduling in Operating Systems

9. Difference between Priority Scheduling and Round Robin (RR) CPU scheduling

10. Difference between Priority scheduling and Shortest Job First (SJF) CPU scheduling

11. Two-level scheduling in Operating Systems

12. Operating Systems | Input Output Systems | Question 2

13. Operating Systems | Input Output Systems | Question 5

14. Operating Systems | Input Output Systems | Question 4

15. Operating Systems | Input Output Systems | Question 5

16. Program for FCFS CPU Scheduling | Set 1

17. Longest Remaining Time First (LRTF) CPU Scheduling Program

18. Advantages and Disadvantages of various CPU scheduling algorithms

19. Fair-share CPU scheduling

20. Difference between First Come First Served (FCFS) and Longest Job First (LJF) CPU scheduling algorithms

21. Difference between FCFS and Priority CPU scheduling

22. Longest Job First (LJF) CPU Scheduling Algorithm

23. Deadline Monotonic CPU Scheduling

24. Difference between EDF and LST CPU scheduling algorithms

25. Difference between Multilevel Queue (MLQ) and Multi Level Feedback Queue (MLFQ) CPU scheduling algorithms