What is the primary goal of CPU scheduling?

• Minimize CPU usage

• Maximize turnaround time

• Ensure all processes finish at the same time

• Minimize response time

Which CPU scheduling algorithm selects the process that arrives first?

• Round Robin

• Shortest Job Next

• First-Come, First-Served

• Priority Scheduling

In Round Robin (RR) scheduling, what does the time quantum represent?

• Maximum execution time per process cycle

• The total time all processes get to run

• The priority of each process

• The waiting time for the longest process

Which scheduling algorithm always selects the process with the shortest burst time?

• First-Come, First-Served

• Shortest Remaining Time First

• Round Robin

• Priority Scheduling

Which scheduling algorithm prevents starvation by aging lower-priority processes?

• First-Come, First-Served

• Shortest Job Next

• Priority Scheduling

• Multilevel Queue Scheduling

What happens in Preemptive Scheduling?

• A process runs until it voluntarily releases the CPU

• A higher-priority process can interrupt a running process

• Only background processes are scheduled

• CPU scheduling is disabled

Which of the following is a disadvantage of First-Come, First-Served (FCFS)?

• Causes starvation

• Complex implementation

• High average waiting time for large processes

• Requires multiple queues

What is the major advantage of Shortest Job Next (SJN) scheduling?

• Maximizes response time

• Reduces average waiting time

• Ensures fair process execution

• Always prevents starvation

Which scheduling algorithm is commonly used in time-sharing systems?

• First-Come, First-Served

• Shortest Job Next

• Round Robin

• Priority Scheduling

Which metric measures the time a process spends waiting in the ready queue?

• Turnaround Time

• Response Time

• Waiting Time

• Completion Time