1. What is CPU scheduler ? Junior A. the number of processes completed by the CPU per unit of time B. a non-preemptive algorithm that runs processes in their order of arrival in a queue C. the OS component that selects which ready process gets the CPU next D. a preemptive algorithm giving each process a fixed time quantum in cyclic order
2. Which term means: "the OS component that selects which ready process gets the CPU next"? Junior A. Non-preemptive scheduling B. CPU scheduler C. Time quantum D. Aging
3. Which statement is correct? Junior A. CPU scheduler — a non-preemptive algorithm that runs processes in their order of arrival in a queue B. CPU scheduler — the OS component that selects which ready process gets the CPU next C. CPU scheduler — an algorithm that runs the ready process with the highest priority value first D. CPU scheduler — an indefinite postponement where a low-priority process never gets the CPU
4. What is FCFS scheduling ? Junior A. a scheduler that picks the ready process with the smallest CPU burst, minimizing average waiting time B. the time from a process's arrival until it first gets the CPU C. a non-preemptive algorithm that runs processes in their order of arrival in a queue D. a technique that gradually raises a waiting process's priority to prevent starvation
5. Which term means: "a non-preemptive algorithm that runs processes in their order of arrival in a queue"? Junior A. Convoy effect B. FCFS scheduling C. Response time D. Waiting time
6. Which statement is correct? Junior A. FCFS scheduling — scheduling where a process keeps the CPU until it blocks or terminates voluntarily B. FCFS scheduling — a non-preemptive algorithm that runs processes in their order of arrival in a queue C. FCFS scheduling — scheduling where the OS can forcibly take the CPU from a running process before it finishes D. FCFS scheduling — the total time a process spends in the ready queue waiting for the CPU
7. What is Shortest Job First ? Mid A. the OS component that selects which ready process gets the CPU next B. scheduling where the OS can forcibly take the CPU from a running process before it finishes C. a scheduler that picks the ready process with the smallest CPU burst, minimizing average waiting time D. the time from a process's arrival until it first gets the CPU
8. Which term means: "a scheduler that picks the ready process with the smallest CPU burst, minimizing average waiting time"? Mid A. Shortest Job First B. Round Robin C. Non-preemptive scheduling D. CPU burst
9. Which statement is correct? Mid A. Shortest Job First — a scheduler that picks the ready process with the smallest CPU burst, minimizing average waiting time B. Shortest Job First — a preemptive algorithm giving each process a fixed time quantum in cyclic order C. Shortest Job First — the total time a process spends in the ready queue waiting for the CPU D. Shortest Job First — the total time from a process's arrival to its completion
10. What is Shortest Remaining Time First ? Mid A. a continuous interval during which a process needs the CPU before its next I/O wait B. the preemptive version of SJF that switches to any arriving job with a shorter remaining burst C. the slowdown in FCFS where short processes wait behind one long CPU-bound process D. the total time from a process's arrival to its completion
11. Which term means: "the preemptive version of SJF that switches to any arriving job with a shorter remaining burst"? Mid A. Shortest Remaining Time First B. Non-preemptive scheduling C. Throughput D. Time quantum
12. Which statement is correct? Mid A. Shortest Remaining Time First — the fixed slice of CPU time each process is allotted in Round Robin before preemption B. Shortest Remaining Time First — the total time a process spends in the ready queue waiting for the CPU C. Shortest Remaining Time First — the preemptive version of SJF that switches to any arriving job with a shorter remaining burst D. Shortest Remaining Time First — an algorithm that runs the ready process with the highest priority value first
13. What is Round Robin ? Junior A. the time the dispatcher takes to stop one process and start another running B. the total time from a process's arrival to its completion C. a preemptive algorithm giving each process a fixed time quantum in cyclic order D. a continuous interval during which a process needs the CPU before its next I/O wait
14. Which term means: "a preemptive algorithm giving each process a fixed time quantum in cyclic order"? Junior A. CPU burst B. Response time C. Time quantum D. Round Robin
15. Which statement is correct? Junior A. Round Robin — a preemptive algorithm giving each process a fixed time quantum in cyclic order B. Round Robin — an algorithm that runs the ready process with the highest priority value first C. Round Robin — the fixed slice of CPU time each process is allotted in Round Robin before preemption D. Round Robin — a technique that gradually raises a waiting process's priority to prevent starvation
16. What is Priority scheduling ? Mid A. an algorithm that runs the ready process with the highest priority value first B. the number of processes completed by the CPU per unit of time C. the time the dispatcher takes to stop one process and start another running D. scheduling where a process keeps the CPU until it blocks or terminates voluntarily
17. Which term means: "an algorithm that runs the ready process with the highest priority value first"? Mid A. CPU scheduler B. Shortest Job First C. Priority scheduling D. Round Robin
18. Which statement is correct? Mid A. Priority scheduling — the fixed slice of CPU time each process is allotted in Round Robin before preemption B. Priority scheduling — a continuous interval during which a process needs the CPU before its next I/O wait C. Priority scheduling — an algorithm that runs the ready process with the highest priority value first D. Priority scheduling — a scheduler with several queues where processes move between queues based on observed CPU behavior
19. What is Multilevel Feedback Queue ? Senior A. a scheduler with several queues where processes move between queues based on observed CPU behavior B. a continuous interval during which a process needs the CPU before its next I/O wait C. the OS component that selects which ready process gets the CPU next D. the preemptive version of SJF that switches to any arriving job with a shorter remaining burst
20. Which term means: "a scheduler with several queues where processes move between queues based on observed CPU behavior"? Senior A. Aging B. Throughput C. Multilevel Feedback Queue D. Preemptive scheduling
21. Which statement is correct? Senior A. Multilevel Feedback Queue — a scheduler with several queues where processes move between queues based on observed CPU behavior B. Multilevel Feedback Queue — scheduling where the OS can forcibly take the CPU from a running process before it finishes C. Multilevel Feedback Queue — the fixed slice of CPU time each process is allotted in Round Robin before preemption D. Multilevel Feedback Queue — a continuous interval during which a process needs the CPU before its next I/O wait
22. What is Preemptive scheduling ? Junior A. the preemptive version of SJF that switches to any arriving job with a shorter remaining burst B. a technique that gradually raises a waiting process's priority to prevent starvation C. an indefinite postponement where a low-priority process never gets the CPU D. scheduling where the OS can forcibly take the CPU from a running process before it finishes
23. Which term means: "scheduling where the OS can forcibly take the CPU from a running process before it finishes"? Junior A. Preemptive scheduling B. Priority scheduling C. Shortest Remaining Time First D. CPU burst
24. Which statement is correct? Junior A. Preemptive scheduling — scheduling where the OS can forcibly take the CPU from a running process before it finishes B. Preemptive scheduling — a scheduler with several queues where processes move between queues based on observed CPU behavior C. Preemptive scheduling — the total time from a process's arrival to its completion D. Preemptive scheduling — a preemptive algorithm giving each process a fixed time quantum in cyclic order
25. What is Non-preemptive scheduling ? Junior A. scheduling where a process keeps the CPU until it blocks or terminates voluntarily B. the number of processes completed by the CPU per unit of time C. the OS component that selects which ready process gets the CPU next D. an indefinite postponement where a low-priority process never gets the CPU
26. Which term means: "scheduling where a process keeps the CPU until it blocks or terminates voluntarily"? Junior A. Non-preemptive scheduling B. CPU burst C. Convoy effect D. Dispatch latency
27. Which statement is correct? Junior A. Non-preemptive scheduling — scheduling where the OS can forcibly take the CPU from a running process before it finishes B. Non-preemptive scheduling — the number of processes completed by the CPU per unit of time C. Non-preemptive scheduling — scheduling where a process keeps the CPU until it blocks or terminates voluntarily D. Non-preemptive scheduling — a scheduler with several queues where processes move between queues based on observed CPU behavior
28. What is Turnaround time ? Junior A. the total time from a process's arrival to its completion B. scheduling where a process keeps the CPU until it blocks or terminates voluntarily C. scheduling where the OS can forcibly take the CPU from a running process before it finishes D. a scheduler with several queues where processes move between queues based on observed CPU behavior
29. Which term means: "the total time from a process's arrival to its completion"? Junior A. Convoy effect B. Time quantum C. Multilevel Feedback Queue D. Turnaround time
30. Which statement is correct? Junior A. Turnaround time — the time from a process's arrival until it first gets the CPU B. Turnaround time — a preemptive algorithm giving each process a fixed time quantum in cyclic order C. Turnaround time — the total time from a process's arrival to its completion D. Turnaround time — scheduling where the OS can forcibly take the CPU from a running process before it finishes Showing 30 of 57 OS · CPU Scheduling questions — the full set, with answers, explanations and an AI tutor on every question, is inside.