NSCT – CPU Scheduling MCQs 20 min Score: 0 Attempted: 0/20 Subscribe 1. . CPU scheduling is the process of: (A) Managing memory (B) Managing devices (C) Managing files (D) Selecting a process for CPU executionShow All Answers 2. . The component that selects the next process to run is called: (A) File manager (B) Device driver (C) CPU Scheduler (D) Loader 3. . Which queue contains processes waiting for CPU? (A) Device queue (B) Ready queue (C) Job queue (D) Waiting queue 4. . The scheduling algorithm that executes processes in the order they arrive is: (A) Round Robin (B) Shortest Job First (C) Priority Scheduling (D) First Come First Serve (FCFS) 5. . Which scheduling algorithm selects the process with the shortest execution time? (A) Shortest Job First (SJF) (B) Priority Scheduling (C) Round Robin (D) FCFS 6. . In Round Robin scheduling, each process gets: (A) Equal time slice (time quantum) (B) Unlimited CPU time (C) Highest priority (D) Lowest priority 7. . The time assigned to each process in Round Robin scheduling is called: (A) Time quantum (B) Turnaround time (C) Waiting time (D) Burst time 8. . Which scheduling algorithm may cause starvation? (A) FIFO (B) FCFS (C) Round Robin (D) Priority Scheduling 9. . CPU scheduling mainly aims to: (A) Increase CPU utilization (B) Reduce waiting time (C) All of the above (D) Improve system performance 10. . The total time taken from process submission to completion is called: (A) Waiting time (B) Execution time (C) Response time (D) Turnaround time 11. . The time a process spends waiting in the ready queue is called: (A) Turnaround time (B) Waiting time (C) Burst time (D) Response time 12. . The time required by a process to execute on the CPU is called: (A) Completion time (B) Waiting time (C) Response time (D) Burst time 13. . Which scheduling algorithm is preemptive? (A) SJF (non-preemptive) (B) FCFS (C) Round Robin (D) FIFO 14. . In preemptive scheduling: (A) CPU cannot be taken from a running process (B) Only one process runs forever (C) CPU can be taken from a running process (D) No scheduling occurs 15. . In non-preemptive scheduling: (A) All processes run together (B) CPU changes every second (C) CPU cannot be taken from a running process until it finishes (D) No process executes 16. . Which algorithm is also known as FIFO scheduling? (A) Round Robin (B) SJF (C) Priority Scheduling (D) FCFS 17. . Which scheduling algorithm is best for time-sharing systems? (A) FCFS (B) Round Robin (C) Priority Scheduling (D) SJF 18. . Starvation means: (A) Memory is full (B) Process finishes quickly (C) CPU stops working (D) Process never gets CPU time 19. . The algorithm that schedules processes based on priority is: (A) SJF (B) Round Robin (C) FCFS (D) Priority Scheduling 20. . The main purpose of CPU scheduling is to: (A) Manage memory (B) Allocate CPU efficiently to processes (C) Store files (D) Control hardware
