📝 Scheduling Criteria in Operating System (53 MCQs)

📖 From Operating System • 6. CPU Scheduling • 53 questions available

←Previous Topic:Dispatcher in CPU Scheduling📝 Scheduling Criteria in Operating SystemFirst Come First Served Scheduling Algorithm in Operating System:Next Topic→

What is Scheduling Criteria in Operating System?

Definition:
Scheduling criteria are quantitative metrics used to evaluate and compare scheduling algorithms, including CPU utilization $U$ , throughput $T$ , turnaround time $T_{turn}$ , waiting time $T_{wait}$ , and response time $T_{resp}$ .

Example:
An administrator compares FCFS and SJF by calculating that SJF yields an average waiting time of 3ms versus FCFS's 7ms for the same workload.

Reason:
These metrics provide objective standards for optimization since different systems prioritize different goals; batch systems maximize throughput while interactive systems minimize response time.

Easy

Medium

Hard

📝 All Scheduling Criteria in Operating System MCQs

Q1. What is CPU utilization in the context of scheduling criteria?

A.The percentage of time the CPU is idle

B.The percentage of time the CPU is executing processes ✅

C.The number of processes completed per second

D.The time taken to respond to a user request

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: CPU utilization measures how busy the CPU is, expressed as the percentage of time it executes processes. Idle time reduces utilization, and throughput measures completed processes per second, not CPU busyness.

Q2. In a real system, CPU utilization typically ranges from:

A.0 to 100 percent

B.10 to 30 percent

C.40 to 90 percent ✅

D.50 to 95 percent

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: CPU utilization in real systems ranges from 40% for lightly loaded systems to 90% for heavily loaded systems. While conceptually it can range from 0-100%, practical systems rarely reach extremes without performance issues.

Q3. Throughput in CPU scheduling is defined as:

A.The time to complete one process

B.The number of processes completed per time unit ✅

C.The time spent waiting in the ready queue

D.The response time of the system

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Throughput measures work done by the system, specifically the number of processes completed per unit time. It varies based on process characteristics and system load, not to be confused with individual process completion times.

Q4. What is turnaround time in CPU scheduling?

A.The time from process submission to first response

B.The time from process submission to completion ✅

C.The time spent waiting in the ready queue

D.The time taken to output results

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Turnaround time is the total interval from process submission until its completion. It includes waiting, execution, and I/O time, making it a comprehensive measure of process completion speed.

Q5. Waiting time in CPU scheduling is defined as:

A.The time from process submission to completion

B.The time spent executing on the CPU

C.The sum of periods spent waiting in the ready queue ✅

D.The time taken to produce the first response

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Waiting time specifically measures time spent in the ready queue waiting for CPU allocation. It excludes execution time and I/O time, focusing purely on scheduling-related delays.

Q6. What is response time in interactive systems?

A.The time from submission to completion

B.The time from submission to first response ✅

C.The time spent waiting in the ready queue

D.The total execution time

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Response time measures the interval from request submission until the first response is produced. It prioritizes initial responsiveness over total completion time, which is crucial for interactive systems where users expect quick feedback.

Q7. Which of the following is generally maximized in CPU scheduling?

A.Turnaround time

B.Waiting time

C.Response time

D.Throughput ✅

💡 Difficulty: easy | ✅ Correct: D

📖 Explanation: Throughput and CPU utilization are generally maximized to get more work done. Turnaround time, waiting time, and response time are minimized to improve system responsiveness and user satisfaction.

Q8. Which of the following is generally minimized in CPU scheduling?

A.CPU utilization

B.Throughput

C.Turnaround time ✅

D.Number of completed processes

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Turnaround time, waiting time, and response time are minimized to provide faster process completion and better user experience. CPU utilization and throughput are maximized to keep the system productive.

Q9. A system processing long processes might have throughput measured as:

A.Ten processes per second

B.One process per hour ✅

C.One hundred processes per second

D.One process per millisecond

💡 Difficulty: easy | ✅ Correct: B

📖 Explanation: Throughput depends on process characteristics. For long processes, throughput might be as low as one process per hour, while short transactions could achieve ten processes per second. The scale varies significantly based on process length and system capability.

Q10. In an interactive system, which metric is more important than turnaround time?

A.CPU utilization

B.Throughput

C.Response time ✅

D.Waiting time

💡 Difficulty: easy | ✅ Correct: C

📖 Explanation: Response time is more important for interactive systems because users need quick feedback. Turnaround time, while relevant, matters less than the initial response, which determines perceived system responsiveness and user satisfaction.

Q11. What components make up turnaround time?

A.Only CPU execution time

B.Waiting in ready queue and CPU execution

C.Waiting to get into memory, ready queue, CPU execution, and I/O ✅

D.Only I/O time and execution time

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Turnaround time includes all intervals from submission to completion: time waiting to get into memory, waiting in the ready queue, CPU execution time, and I/O time. It comprehensively measures total process completion time.

Q12. The CPU-scheduling algorithm primarily affects which of the following?

A.CPU execution time

B.I/O time

C.Memory allocation time

D.Waiting time in the ready queue ✅

💡 Difficulty: medium | ✅ Correct: D

📖 Explanation: The scheduling algorithm only affects the time a process spends waiting in the ready queue. Execution time and I/O time are determined by process characteristics and hardware, not by the scheduling algorithm.

Q13. If a system has high CPU utilization, what can be inferred about throughput?

A.Throughput must be high

B.Throughput must be low

C.Throughput is not directly determined by utilization alone ✅

D.Throughput is unrelated to CPU utilization

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: High CPU utilization suggests the CPU is busy, but throughput depends on what the CPU is doing. A CPU could be busy with long processes, resulting in lower throughput, or short processes, resulting in higher throughput. They are correlated but not directly determined.

Q14. For interactive systems, researchers suggest minimizing the variance in response time rather than the average. Why?

A.Variance is easier to measure

B.Predictable response time is more desirable than faster but variable response ✅

C.Average response time is irrelevant

D.Users prefer faster response sometimes

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Predictable response times create a consistent user experience, making the system seem more reliable. Highly variable response times, even with a faster average, can frustrate users because they cannot anticipate how long operations will take.

Q15. A system has processes with extremely short CPU bursts. Which scheduling metric would be most affected?

A.CPU utilization

B.Turnaround time

C.Throughput ✅

D.Response time

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Short processes complete quickly, so throughput (processes completed per time unit) would be high. Turnaround time and response time would also be low, but the most distinctive impact is on throughput, which would show many completions per second.

Q16. What is the primary goal when optimizing for maximum response time?

A.To reduce the average waiting time

B.To guarantee all users get good service ✅

C.To maximize CPU utilization

D.To minimize turnaround time

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Optimizing for maximum response time minimizes the worst-case response, ensuring even the slowest process gets reasonable service. This guarantees fair service to all users, preventing any single user from experiencing excessive delays.

Q17. A system designer wants to minimize the variance in response time. Which scheduling approach would likely achieve this?

A.Algorithms that prioritize short processes

B.Algorithms that ensure fairness and predictable CPU allocation ✅

C.Algorithms that maximize throughput

D.Algorithms that minimize average waiting time

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Fairness and predictable allocation help reduce variance in response times by ensuring all processes receive regular CPU service. Prioritizing short processes can increase variance for longer processes, and optimizing solely for throughput or average waiting time doesn't guarantee predictable individual response times.

Q18. In comparing scheduling algorithms, what is the relationship between average and maximum values?

A.Only average values matter

B.Only maximum values matter

C.We might optimize the minimum or maximum values instead of the average ✅

D.Average and maximum values are always equal

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: While average measures are commonly optimized, some scenarios require optimizing the minimum or maximum. For example, guaranteeing good service for all users might require minimizing the maximum response time, and fairness might require maximizing the minimum processing time.

Q19. CPU utilization in a lightly loaded system is typically around:

A.0.9

B.0.4 ✅

C.1

D.0.1

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Lightly loaded systems typically have CPU utilization around 40%, reflecting periods of idle time when there are fewer ready processes. Heavily loaded systems approach 90% utilization, but 100% is rarely achieved due to overhead and idle periods.

Q20. Which criterion would be most important for a batch processing system?

A.Response time

B.Variance in response time

C.Turnaround time

D.CPU utilization and throughput ✅

💡 Difficulty: medium | ✅ Correct: D

📖 Explanation: Batch systems focus on maximizing work done, so CPU utilization and throughput are most important. Response time and variance are less relevant because there are no users waiting for immediate interaction.

Q21. A process takes 10 milliseconds to execute on the CPU and spends 5 milliseconds waiting in the ready queue. What is its waiting time?

A.15 milliseconds

B.10 milliseconds

C.5 milliseconds ✅

D.20 milliseconds

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Waiting time is specifically the time spent in the ready queue, which is 5 milliseconds. The total turnaround time would be 15 milliseconds (waiting + execution), but waiting time only measures queue waiting time.

Q22. What is the significance of the output device's speed on turnaround time?

A.It has no effect on turnaround time

B.It limits the turnaround time for processes with I/O ✅

C.It affects only CPU utilization

D.It only affects response time

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: For processes that produce output, the speed of the output device limits turnaround time because the process isn't complete until output is delivered. While I/O time is part of turnaround time, output device speed specifically affects the final completion.

Q23. Why is minimizing variance in response time considered more desirable than minimizing average response time for interactive systems?

A.Variance is easier to calculate

B.Users prefer consistent predictability over sometimes fast, sometimes slow response ✅

C.Average response time is always higher

D.Variance affects throughput more

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Consistent response time allows users to develop expectations and trust in the system. A system that is fast but unpredictable frustrates users because they cannot plan their work effectively. Predictability often improves perceived performance more than raw speed.

Q24. Which scheduling criterion directly measures the total time a process spends from submission to completion?

A.CPU utilization

B.Throughput

C.Turnaround time ✅

D.Waiting time

💡 Difficulty: medium | ✅ Correct: C

📖 Explanation: Turnaround time measures the complete interval from process submission to final completion, encompassing all waiting, execution, and I/O. It is the most comprehensive measure of process completion speed.

Q25. What is the difference between response time and turnaround time?

A.Response time includes I/O time, turnaround time does not

B.Turnaround time measures completion, response time measures first response ✅

C.They are the same

D.Response time is always longer

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Response time is the interval from submission to first response, while turnaround time is submission to completion. For interactive processes, response time is shorter because it doesn't wait for final output. This distinction is crucial for user experience evaluation.

Q26. A heavily loaded system typically achieves CPU utilization around:

A.0.4

B.0.9 ✅

C.1

D.0.5

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Heavily loaded systems typically achieve around 90% CPU utilization. While conceptually 100% is possible, practical systems have overhead from context switching, interrupts, and idle periods waiting for I/O, so 90% is a realistic maximum for heavily loaded systems.

Q27. Which of the following is NOT a component of turnaround time?

A.Time waiting in the ready queue

B.Time executing on the CPU

C.Time waiting for I/O completion

D.Time spent in the output device queue ✅

💡 Difficulty: medium | ✅ Correct: D

📖 Explanation: Turnaround time includes waiting to get into memory, ready queue waiting, CPU execution, and I/O time. Time in the output device queue is not specifically mentioned as a component, though it could be considered part of I/O time for output operations.

Q28. What does the response time metric prioritize in scheduling algorithm evaluation?

A.Fast completion of processes

B.Quick initial feedback to users ✅

C.High throughput

D.Low CPU idle time

💡 Difficulty: medium | ✅ Correct: B

📖 Explanation: Response time prioritizes quick initial feedback, not necessarily fast completion. This is crucial for interactive systems where users need immediate acknowledgment of their requests, even if the total processing takes longer.

Q29. A system designer wants to optimize CPU utilization. Which of the following would be most helpful?

A.Reducing the number of processes

B.Running longer processes

C.Keeping the ready queue non-empty ✅

D.Increasing I/O operations

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Keeping the ready queue non-empty ensures the CPU always has work, maximizing utilization. Reducing processes or increasing I/O might cause idle periods. Longer processes don't guarantee higher utilization; if they involve I/O, they could cause idle periods.

Q30. A system with high throughput can have low CPU utilization. How is this possible?

A.Throughput and utilization are always directly proportional

B.If processes are I/O-bound, CPU might be idle while throughput counts completed processes ✅

C.Throughput measures only CPU processes

D.This scenario is impossible

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: I/O-bound processes complete quickly without using much CPU, achieving high throughput while CPU utilization remains low. Throughput measures completions per time unit, not CPU usage. This shows why multiple metrics are needed to evaluate system performance comprehensively.

Q31. A process has a turnaround time of 50 milliseconds, waiting time of 20 milliseconds, and I/O time of 15 milliseconds. What is its CPU execution time?

A.15 milliseconds ✅

B.20 milliseconds

C.35 milliseconds

D.10 milliseconds

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: Turnaround time = CPU time + waiting time + I/O time. Rearranging: CPU time = 50 - 20 - 15 = 15 milliseconds. This shows the relationship between all components of turnaround time.

Q32. An interactive system has average response time of 100ms with variance of 2500ms² (std dev 50ms). Another system has average response time of 120ms with variance of 100ms² (std dev 10ms). Which is more desirable?

A.The first system, because average is lower

B.The second system, because variance is lower ✅

C.Both systems are equally good

D.Cannot determine from given information

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: The second system is more desirable despite higher average because consistent performance (lower variance) provides predictable user experience. Variable response time frustrates users even if average is slightly better, as researchers have confirmed for interactive systems.

Q33. What is the minimum possible value for response time in a system with a time quantum of 20ms?

A.0ms

B.10ms

C.20ms

D.Depends on scheduling algorithm ✅

💡 Difficulty: hard | ✅ Correct: D

📖 Explanation: The minimum response time depends on the scheduling algorithm, not solely on the time quantum. Response time could be very small if a process is scheduled immediately, or it could be multiple quanta if others are ahead. The time quantum sets an upper bound but not the minimum.

Q34. A system has 3 processes with waiting times: 10ms, 20ms, and 30ms. What is the maximum waiting time?

A.10ms

B.20ms

C.30ms ✅

D.15ms

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: The maximum waiting time is 30ms, which is the highest individual value. While average waiting time is often used, optimizing the maximum (minimizing the worst case) is sometimes necessary to guarantee fairness and prevent starvation.

Q35. Which scheduling metric is most directly affected by the choice of time quantum in a round-robin system?

A.CPU utilization

B.Throughput

C.Response time ✅

D.Turnaround time for long processes

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: The time quantum directly affects response time in round-robin scheduling. A shorter quantum improves response time (processes get CPU sooner) but increases overhead. A longer quantum improves throughput but degrades response time for interactive tasks.

Q36. Why has little work been done on CPU-scheduling algorithms that minimize variance?

A.Variance is not important

B.Variance is difficult to model and optimize ✅

C.Minimizing average automatically minimizes variance

D.Variance is irrelevant to scheduling

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Variance is more complex to model and optimize because it requires considering distributions and probabilistic behavior. Most scheduling theory focuses on deterministic or average-case analysis, making variance minimization an advanced and less explored area.

Q37. In a system with processes of varying lengths, which is a better measure of system performance: average waiting time or maximum waiting time?

A.Average waiting time, because it represents typical performance

B.Maximum waiting time, because it ensures fairness

C.Both are important for different reasons ✅

D.Neither is useful

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Average waiting time represents overall efficiency, while maximum waiting time ensures no process is starved. Both are important: average for typical performance and maximum for worst-case guarantees. The choice depends on whether performance or fairness is the priority.

Q38. A scheduler prioritizes CPU-bound processes. What is the likely effect on response time for I/O-bound processes?

A.Improvement

B.No change

C.Deterioration ✅

D.Cannot be determined

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Prioritizing CPU-bound processes means I/O-bound processes wait longer for CPU, increasing their response time and potentially their waiting time. This can degrade interactive performance because I/O-bound processes often represent user interactions.

Q39. Which criterion is measured in processes per second?

A.CPU utilization

B.Throughput ✅

C.Turnaround time

D.Waiting time

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Throughput is specifically measured in processes completed per time unit (e.g., processes per second). CPU utilization is a percentage, turnaround and waiting times are measured in time units, not completions per second.

Q40. What is the effect of context switching overhead on CPU utilization?

A.Increases utilization

B.Decreases utilization ✅

C.No effect

D.Depends on the scheduling algorithm

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Context switching overhead reduces CPU utilization because the CPU spends time switching processes instead of executing them. High context switch rates can significantly degrade CPU utilization, which is why efficient dispatching is important.

Q41. A process has a turnaround time of 100ms, CPU execution time of 40ms, and I/O time of 35ms. What is its waiting time?

A.25ms ✅

B.75ms

C.15ms

D.35ms

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: Waiting time = Turnaround time - CPU time - I/O time = 100 - 40 - 35 = 25ms. This calculation shows how waiting time is derived from other scheduling metrics and represents time spent in the ready queue.

Q42. Which scheduling goal is generally in conflict with good response time for interactive systems?

A.Maximizing CPU utilization ✅

B.Minimizing waiting time

C.Maximizing throughput

D.Minimizing turnaround time

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: Maximizing CPU utilization often conflicts with good response time because it may involve running long CPU-bound processes to keep the CPU busy, delaying interactive processes. Throughput can also conflict, but response time and throughput tradeoff is more nuanced.

Q43. A system has response times: 10ms, 15ms, 20ms, 100ms, 110ms. What can be inferred about the scheduler?

A.It minimizes average response time well

B.It has high variance in response time ✅

C.It achieves perfect fairness

D.It is optimal

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: The wide spread from 10ms to 110ms indicates high variance, meaning response times are unpredictable. While average might be reasonable, the 110ms outlier suggests some processes experience significant delays, making the system less desirable for interactive use.

Q44. What would be the effect of eliminating the ready queue on waiting time?

A.Waiting time would increase

B.Waiting time would decrease to zero ✅

C.Waiting time would remain the same

D.The system would not function

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: If there were no ready queue, processes would go directly to the CPU, eliminating waiting time. However, this is impractical because it would require infinite CPUs or only one process. This illustrates that waiting time is inherent to multiprogramming.

Q45. A system with 10 processes has average waiting time of 25ms. Each process has CPU execution of 10ms and I/O time of 5ms. What is the average turnaround time?

A.40ms ✅

B.35ms

C.25ms

D.15ms

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: Turnaround time = CPU time + I/O time + waiting time = 10 + 5 + 25 = 40ms. This demonstrates how turnaround time combines execution, I/O, and waiting components to give total process completion time.

Q46. In a system with equal priorities, what would be the dominant factor affecting waiting time?

A.Process CPU burst length

B.Number of ready processes ✅

C.I/O device speed

D.Memory size

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: With equal priorities, the number of ready processes is the primary factor affecting waiting time. More processes sharing the CPU mean each waits longer. CPU burst length affects how long each uses the CPU but not the waiting time structure as much as the competition level.

Q47. What is the relationship between response time and variance in interactive systems?

A.Lower response time implies lower variance

B.Higher variance suggests unpredictable performance ✅

C.Variance is unrelated to response time

D.Only average response time matters

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Higher variance means response times are unpredictable, with some requests taking much longer than others. This unpredictability reduces user satisfaction even if average response time is acceptable. Researchers emphasize minimizing variance for predictable interactive performance.

Q48. A system is designed to minimize maximum response time. What is this approach called?

A.Average optimization

B.Worst-case optimization ✅

C.Best-case optimization

D.Maximum variance approach

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Minimizing maximum response time is worst-case optimization, ensuring even the worst-performing process receives acceptable service. This guarantees fairness and prevents any process from being starved, which is crucial for real-time systems and environments where all users deserve good performance.

Q49. Which scheduling criterion does NOT depend on the process's I/O requirements?

A.Turnaround time

B.Waiting time ✅

C.CPU utilization

D.Throughput

💡 Difficulty: hard | ✅ Correct: B

📖 Explanation: Waiting time depends only on time in the ready queue, which is affected by scheduling decisions and competition. Turnaround time includes I/O, CPU utilization depends on whether processes need CPU or I/O, and throughput is affected by I/O because I/O-bound processes complete quickly, increasing throughput.

Q50. A system has 5 processes with waiting times: 0ms, 5ms, 10ms, 15ms, 20ms. What is the average waiting time?

A.10ms ✅

B.15ms

C.20ms

D.12ms

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: Average = (0 + 5 + 10 + 15 + 20) / 5 = 50 / 5 = 10ms. This simple average shows the typical waiting time experienced by processes, though individual processes have varying waiting times from 0 to 20ms.

Q51. Why is CPU utilization not always maximized in systems with good response time?

A.Maximizing utilization requires running long CPU processes

B.Good response time requires prompt scheduling

C.Both A and B ✅

D.CPU utilization is always maximized

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Maximizing CPU utilization might require running long CPU-bound processes to keep the CPU busy, which delays interactive processes (good response time requires prompt service). This tradeoff means optimizing both simultaneously is impossible, so systems often balance them.

Q52. What is the maximum possible value for CPU utilization?

A.0.5

B.0.9

C.1 ✅

D.0.85

💡 Difficulty: hard | ✅ Correct: C

📖 Explanation: Conceptually, CPU utilization can reach 100% (the CPU is always busy). However, practical limitations from context switching, interrupts, and idle periods while waiting for I/O mean 90% is typical for heavily loaded systems. The theoretical maximum remains 100%, even if practically unattainable.

Q53. A process is submitted to a system. It waits 15ms to get into memory, 20ms in the ready queue, executes for 30ms, and does I/O for 10ms. What is its turnaround time?

A.75ms ✅

B.65ms

C.55ms

D.45ms

💡 Difficulty: hard | ✅ Correct: A

📖 Explanation: Turnaround time = 15 (memory wait) + 20 (ready queue) + 30 (CPU) + 10 (I/O) = 75ms. This comprehensive calculation shows all components that contribute to the total time from submission to completion, including memory waiting time which is often overlooked.

🔗 Related Topics (MCQs)

📝 CPU Scheduling Basic Concepts MCQs 📝 CPU I/O Burst Cycle MCQs 📝 CPU Scheduler in Operating System MCQs 📝 Preemptive Scheduling in Operating System MCQs 📝 Dispatcher in CPU Scheduling MCQs

←Previous Topic:Dispatcher in CPU Scheduling📝 Scheduling Criteria in Operating SystemFirst Come First Served Scheduling Algorithm in Operating System:Next Topic→