1. What is CPU scheduling?

a) Allocating memory to processes

b) Allocating CPU time to processes

c) Allocating I/O devices to processes

d) Allocating disk space to processes

Answer: b) Allocating CPU time to processes

2. Which of the following is NOT a type of CPU scheduling?

a) Non-preemptive scheduling

b) Priority scheduling

c) Secondary scheduling

d) Round-robin scheduling

Answer: c) Secondary scheduling

3. What is the goal of CPU scheduling?

a) Maximize CPU utilization

b) Minimize waiting time

c) Maximize throughput

d) All of the above

Answer: d) All of the above

4. Which scheduling algorithm executes the process with the highest priority first?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: c) Priority scheduling

5. In which scheduling algorithm is the process with the shortest burst time executed next?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

d) Round-robin scheduling

Answer: b) Shortest Job First (SJF)

6. What scheduling algorithm uses a fixed time quantum for each process?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: d) Round-robin scheduling

7. Which scheduling algorithm may lead to starvation for lower-priority processes?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: c) Priority scheduling

8. What is the primary goal of the Multi-Level Feedback Queue scheduling algorithm?

a) Minimize turnaround time

b) Maximize throughput

c) Prevent priority inversion

d) Avoid priority aging

Answer: c) Prevent priority inversion

9. What type of scheduler makes the decision of which process to execute next?

a) Long-term scheduler
b) Medium-term scheduler

c) Short-term scheduler

d) Secondary scheduler

Answer: c) Short-term scheduler

10. Which scheduling algorithm follows the "first come, first served" principle?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: a) First-Come-First-Serve (FCFS)

11. Which scheduling algorithm may suffer from the "convoy effect"?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: a) First-Come-First-Serve (FCFS)

12. In preemptive scheduling, can a running process be forcibly interrupted and moved to the ready
queue?

a) Yes

b) No

Answer: a) Yes

13. Which scheduling algorithm guarantees that every process will get an equal share of the CPU
time?

a) First-Come-First-Serve (FCFS)
b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: d) Round-robin scheduling

14. What is the primary disadvantage of non-preemptive scheduling?

a) High response time

b) Poor CPU utilization

c) Low throughput

d) None of the above

Answer: b) Poor CPU utilization

15. Which scheduling criterion measures the time from submission to completion of a process?

a) Turnaround time

b) Response time

c) Waiting time

d) Execution time

Answer: a) Turnaround time

16. What is the role of the dispatcher in CPU scheduling?

a) Deciding which process to execute next

b) Allocating CPU time to processes

c) Managing I/O devices

d) Loading and unloading processes into memory

Answer: d) Loading and unloading processes into memory

17. In real-time scheduling, what is the highest priority level assigned to?
a) Background tasks

b) System processes

c) User processes

d) Critical tasks

Answer: d) Critical tasks

18. Which scheduling algorithm may not work well in a time-sharing environment with interactive
users?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: a) First-Come-First-Serve (FCFS)

19. In multiprocessor scheduling, what is the goal?

a) Minimize turnaround time

b) Maximize throughput

c) Avoid process starvation

d) Optimize memory usage

Answer: b) Maximize throughput

20. What is a key characteristic of real-time scheduling?

a) High CPU utilization

b) Low priority for critical tasks

c) Predictable and deterministic execution

d) Dynamic priority assignment

Answer: c) Predictable and deterministic execution

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: d) Round-robin scheduling

22. What is the drawback of using a small time quantum in round-robin scheduling?

a) High CPU utilization

b) High context switch overhead

c) Low throughput

d) None of the above

Answer: b) High context switch overhead

23. Which scheduling algorithm assigns a priority value to each process and schedules them based
on these priorities?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: c) Priority scheduling

24. In a multi-level feedback queue scheduling, how are processes promoted to higher priority
queues?

a) Based on the age of the process

b) Based on the number of times they've been in the lower queue

c) Based on their execution time

d) Randomly
Answer: b) Based on the number of times they've been in the lower queue

25. What is the purpose of a real-time scheduler in an operating system?

a) To ensure all tasks are scheduled equally

b) To maximize CPU utilization

c) To meet deadlines for critical tasks

d) To minimize context switches

Answer: c) To meet deadlines for critical tasks

26. Which scheduling algorithm is susceptible to the "starvation" problem?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: c) Priority scheduling

27. In multiprocessor scheduling, what is the primary challenge compared to single-processor

a) Ensuring fairness among processes

b) Reducing context switch overhead

c) Coordinating access to shared resources

d) Increasing CPU utilization

Answer: c) Coordinating access to shared resources

28. Which scheduling algorithm is based on the estimated remaining time of a process's execution?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

d) Round-robin scheduling

Answer: b) Shortest Job First (SJF)

29. What does the term "context switch" refer to in CPU scheduling?

a) The time a process spends executing

b) The time a process spends waiting in the ready queue

c) The process of saving and restoring a process's state when switching between processes

d) The process of allocating CPU time to processes

Answer: c) The process of saving and restoring a process's state when switching between processes

30. Which scheduling algorithm may result in poor response times for long-running processes?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: a) First-Come-First-Serve (FCFS)

31. In non-preemptive scheduling, when does a process release the CPU voluntarily?

a) When it finishes its execution

b) When a higher-priority process becomes available

c) After a fixed time quantum

d) Never, it always holds the CPU until it completes.

Answer: a) When it finishes its execution

32. Which scheduling algorithm may lead to process starvation for longer processes waiting in the
ready queue?
a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: a) First-Come-First-Serve (FCFS)

33. What is the primary purpose of the long-term scheduler?

a) To allocate CPU time to processes

b) To manage I/O devices

c) To select processes from the job queue and load them into memory

d) To maintain process priorities

Answer: c) To select processes from the job queue and load them into memory

34. What scheduling criterion measures the time between submitting a process and its first response
from the system?

a) Turnaround time

b) Response time

c) Waiting time

d) Execution time

Answer: b) Response time

35. Which scheduling algorithm allows processes to share the CPU fairly in a time-sharing
environment?

a) First-Come-First-Serve (FCFS)

b) Shortest Job First (SJF)

c) Priority scheduling

d) Round-robin scheduling

Answer: d) Round-robin scheduling