Lecture 11

You might also like

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 2

1. What is a primary goal of scheduling algorithms in all environments?

A) Increase complexity
B) Maintain fairness
C) Minimize interaction
2. What is the main goal in batch system scheduling?
A) Maximize CPU utilization
B) Maximize throughput
C) Enhance security measures
3. How does the First-Come First-Served scheduling algorithm assign CPU time?
A) By process priority
B) By shortest job first
C) In the order processes request it
4. What is a disadvantage of the First-Come First-Served scheduling algorithm?
A) It is complex to implement
B) It can cause long wait times for I/O-bound processes
C) It uses excessive CPU resources
5. What makes the Shortest Job First scheduling algorithm optimal?
A) It prioritizes longer jobs
B) It minimizes overall turnaround time
C) It runs processes based on priority
6. What is a key characteristic of real-time systems in scheduling?
A) They require no preemption
B) They need to meet deadlines
C) They prioritize interactive processes
7. What kind of scheduling is typically used in interactive environments?
A) First-Come First-Served
B) Preemptive
C) Nonpreemptive
8. Why is proportionality important in scheduling?
A) It ensures quick response times
B) It aligns with user expectations regarding time
C) It prioritizes security-related processes
9. What does CPU utilization fail to accurately represent in batch systems?
A) The number of jobs completed per hour
B) System security
C) Process priority
10. Which scheduling algorithm allows new short jobs to get good service by preempting
longer ones?
A) First-Come First-Served
B) Shortest Job First
C) Shortest Remaining Time Next
11. In a batch system, what is a critical consideration for scheduling?
A) Minimizing user interaction
B) Keeping all system components busy
C) Prioritizing background processes
12. How do scheduling algorithms in batch systems typically improve system performance?
A) By maximizing CPU-bound job completion
B) By balancing CPU and I/O-bound jobs
C) By focusing solely on I/O-bound jobs
13. What metric measures the number of jobs completed per hour in a batch system?
A) Throughput
B) Turnaround time
C) CPU utilization
14. What is the aim of minimizing turnaround time in batch systems?
A) Increase security
B) Reduce user waiting time
C) Prioritize CPU-intensive jobs
15. How do real-time systems differ from interactive systems in their scheduling needs?
A) Real-time systems require predictable scheduling
B) Real-time systems have no need for preemption
C) Real-time systems focus on user interaction
16. What could be a significant issue with using Shortest Job First in a dynamic
environment?
A) It cannot adapt to new jobs arriving
B) It prioritizes long jobs
C) It requires manual scheduling
17. How does the scheduler enforce policies in an operating system?
A) By allowing all processes equal CPU time
B) By treating different process categories differently
C) By focusing solely on throughput
18. What role does fairness play in scheduling algorithms?
A) Ensures all processes complete in order of priority
B) Ensures comparable processes get comparable service
C) Guarantees minimal CPU utilization
19. What is a significant advantage of the Shortest Remaining Time Next algorithm?
A) It simplifies the scheduling process
B) It allows for adjusting priorities on the fly
C) It provides fairness by time slicing
20. What is a general goal in all scheduling environments?
A) To increase throughput
B) To ensure fairness and enforce policies
C) To minimize CPU utilization

1. B, 2. B, 3. C, 4. B, 5. B, 6. B, 7. B, 8. B, 9. A, 10. C, 11. B, 12. B, 13. A, 14. B, 15. A, 16. A, 17. B, 18.


B, 19. C, 20. B.

You might also like