Question:
Which CPU scheduling algorithm uses time quantum for processes?
Which CPU scheduling algorithm uses time quantum for processes?
Show Hint
Round Robin is the most common preemptive scheduling algorithm used in time-sharing operating systems.
Updated On: Jun 25, 2026
- Shortest Job First
- First Come First Serve
- Round Robin
- Shortest Remaining Job Next
Show Solution
Verified By Collegedunia
The Correct Option is C
Solution and Explanation
Concept:
CPU scheduling determines how CPU time is allocated among processes.
Round Robin scheduling is specifically designed for time-sharing systems.
Step 1: Understand time quantum.
A time quantum is a fixed amount of CPU time assigned to a process. After the quantum expires, the process is preempted.
Step 2: Working of Round Robin.
Processes are arranged in a circular queue. Each process receives CPU time for one quantum. If unfinished, it moves to the end of the queue.
Step 3: Identify the scheduling algorithm.
The scheduling algorithm based on time quantum is \[ \boxed{\text{Round Robin}} \]
Step 1: Understand time quantum.
A time quantum is a fixed amount of CPU time assigned to a process. After the quantum expires, the process is preempted.
Step 2: Working of Round Robin.
Processes are arranged in a circular queue. Each process receives CPU time for one quantum. If unfinished, it moves to the end of the queue.
Step 3: Identify the scheduling algorithm.
The scheduling algorithm based on time quantum is \[ \boxed{\text{Round Robin}} \]
Was this answer helpful?
0
0
Top TS PGECET Computer Science & Information Technology Questions
- The transition a pushdown automation made by is additionally dependent upon
- Moore machine is an example of
- For a machine to surpass all the letters of alphabets excluding vowels, how many states in DFA would be required?
- A language $L$ is said to be Turing machine (TM) decidable if
- A Turing machine that is able to simulate other Turing machines is known as
View More Questions
Top TS PGECET Operating Systems Questions
- When a process is waiting to be assigned to a processor, then it is in
- Which system call is used to create a new process?
- In client-server system communication, _______ is defined as an endpoint for communication
- In Operating system, unlimited threads could exhaust system resources. Which among the following is a solution to this issue?
What is the average waiting time for the following processes using round robin scheduling with a time quantum of 4 ms?
Process Burst Time P1 24 P2 3 P3 3
View More Questions
Top TS PGECET Questions
- If \( P = \begin{pmatrix} 1 & 1 & 1 \\ 0 & 1 & 2 \\ 0 & 0 & 1 \end{pmatrix} \) is the modal matrix of \( A = \begin{pmatrix} 1 & 1 & 0 \\ 0 & 2 & 2 \\ 0 & 0 & 3 \end{pmatrix} \) then the sum of all the elements of \( P^{-1}AP \) is
- If the system of equations \( kx + y + z = k - 1 \), \( x + ky + z = k - 1 \), and \( x + y + kz = k - 1 \) has infinite solutions, then \( k \) is
- The value of the integral \( \int_C (2xy - x^2) \, dx + (x^2 + y^2) \, dy \) where \( C \) is the boundary of the region enclosed by \( y = x^2 \) and \( y^2 = x \), described in the positive sense, is
- Let \( f(x) = \log x \). The number \( C \) strictly between \( e^2 \) and \( e^3 \) such that its reciprocal is equal to \( \frac{f(e^3) - f(e^2)}{e^3 - e^2} \) is
- The solution of the differential equation \( (D^2 + 2)y = x^2 \) is
View More Questions