Q#1: CPU scheduling is:
(A) Selecting which process will run on the CPU next
(B) Allocating memory to a process
(C) Managing disk operations
(D) Controlling I/O devices
Answer: (A) Selecting which process will run on the CPU next
Q#2: CPU scheduling is done by:
(A) The short-term scheduler
(B) The long-term scheduler
(C) The medium-term scheduler
(D) The memory manager
Answer: (A) The short-term scheduler
Q#3: Scheduling criteria include:
(A) CPU utilization, throughput, turnaround time, waiting time, response time
(B) Only CPU utilization
(C) Only memory usage
(D) Only disk throughput
Answer: (A) CPU utilization, throughput, turnaround time, waiting time, response time
Q#4: First-Come, First-Served (FCFS) is:
(A) Non-preemptive scheduling
(B) Preemptive
(C) Priority-based
(D) Round-robin
Answer: (A) Non-preemptive scheduling
Q#5: Shortest Job Next (SJN) is also called:
(A) Shortest Job First (SJF)
(B) FCFS
(C) Priority scheduling
(D) Round-robin
Answer: (A) Shortest Job First (SJF)
Q#6: SJN can be:
(A) Preemptive or non-preemptive
(B) Only non-preemptive
(C) Only preemptive
(D) Only round-robin
Answer: (A) Preemptive or non-preemptive
Q#7: Preemptive SJF is called:
(A) Shortest Remaining Time First (SRTF)
(B) FCFS
(C) Round-robin
(D) Priority scheduling
Answer: (A) Shortest Remaining Time First (SRTF)
Q#8: Round-Robin scheduling uses:
(A) Fixed time quantum for each process
(B) Shortest job selection
(C) Only priority
(D) Only first-come order
Answer: (A) Fixed time quantum for each process
Q#9: Time quantum in round-robin scheduling affects:
(A) CPU utilization, turnaround time, response time
(B) Only memory usage
(C) Only disk operations
(D) Only I/O devices
Answer: (A) CPU utilization, turnaround time, response time
Q#10: Priority scheduling assigns:
(A) CPU based on process priority
(B) CPU based on arrival time only
(C) CPU randomly
(D) CPU based on memory size
Answer: (A) CPU based on process priority
Q#11: In preemptive priority scheduling:
(A) A higher priority process can preempt a running lower-priority process
(B) Processes run until completion
(C) Only CPU-bound processes run
(D) Only I/O-bound processes run
Answer: (A) A higher priority process can preempt a running lower-priority process
Q#12: Starvation can occur in:
(A) Priority scheduling
(B) FCFS
(C) Round-robin
(D) SJF non-preemptive
Answer: (A) Priority scheduling
Q#13: Aging prevents starvation by:
(A) Gradually increasing priority of waiting processes
(B) Decreasing priority
(C) Halting CPU
(D) Terminating processes
Answer: (A) Gradually increasing priority of waiting processes
Q#14: Multilevel queue scheduling:
(A) Divides ready queue into separate queues based on process type
(B) Only uses one queue
(C) Only priority scheduling
(D) Only round-robin
Answer: (A) Divides ready queue into separate queues based on process type
Q#15: Multilevel feedback queue scheduling allows:
(A) Processes to move between queues based on behavior and aging
(B) Processes stay in one queue
(C) Only FCFS in queues
(D) Only round-robin in queues
Answer: (A) Processes to move between queues based on behavior and aging
Q#16: Preemptive scheduling advantages include:
(A) Better response time for high-priority processes
(B) Only memory efficiency
(C) Only disk usage
(D) Only CPU utilization
Answer: (A) Better response time for high-priority processes
Q#17: Non-preemptive scheduling advantages include:
(A) Simple implementation and low overhead
(B) Immediate response for interactive processes
(C) Only memory efficiency
(D) Only I/O management
Answer: (A) Simple implementation and low overhead
Q#18: Turnaround time is:
(A) Total time taken for a process from submission to completion
(B) Only CPU execution time
(C) Only waiting time
(D) Only I/O time
Answer: (A) Total time taken for a process from submission to completion
Q#19: Waiting time is:
(A) Total time a process spends in the ready queue
(B) Time in CPU
(C) Only I/O time
(D) Only memory allocation time
Answer: (A) Total time a process spends in the ready queue
Q#20: Response time is:
(A) Time from submission to first response
(B) Total execution time
(C) Only waiting time
(D) Only disk access time
Answer: (A) Time from submission to first response
Q#21: Throughput is:
(A) Number of processes completed per unit time
(B) Only CPU utilization
(C) Only memory usage
(D) Only disk operations
Answer: (A) Number of processes completed per unit time
Q#22: CPU utilization aims to:
(A) Keep CPU as busy as possible
(B) Only reduce memory usage
(C) Only increase disk access
(D) Only schedule I/O
Answer: (A) Keep CPU as busy as possible
Q#23: FCFS scheduling suffers from:
(A) Convoy effect, where short processes wait for long ones
(B) Starvation
(C) Aging issues
(D) Only memory fragmentation
Answer: (A) Convoy effect, where short processes wait for long ones
Q#24: SJF scheduling is optimal in:
(A) Minimizing average waiting time
(B) Maximizing CPU idle time
(C) Only disk usage
(D) Only I/O operations
Answer: (A) Minimizing average waiting time
Q#25: Round-robin is best for:
(A) Time-sharing systems
(B) Batch systems
(C) Only priority systems
(D) Only real-time systems
Answer: (A) Time-sharing systems
Q#26: Context switching occurs when:
(A) CPU switches from one process to another
(B) Only memory allocated
(C) Only disk accessed
(D) Only I/O occurs
Answer: (A) CPU switches from one process to another
Q#27: Preemption is required for:
(A) Round-robin, priority scheduling, SRTF
(B) FCFS non-preemptive
(C) Only disk operations
(D) Only memory management
Answer: (A) Round-robin, priority scheduling, SRTF
Q#28: Non-preemptive algorithms:
(A) Run process until it terminates or waits for I/O
(B) CPU forcibly switches process
(C) Only memory operations
(D) Only disk I/O
Answer: (A) Run process until it terminates or waits for I/O
Q#29: SRTF scheduling is:
(A) Preemptive version of SJF
(B) Non-preemptive SJF
(C) FCFS
(D) Round-robin
Answer: (A) Preemptive version of SJF
Q#30: Priority scheduling can be:
(A) Preemptive or non-preemptive
(B) Only non-preemptive
(C) Only preemptive
(D) Only round-robin
Answer: (A) Preemptive or non-preemptive
Q#31: Aging improves:
(A) Fairness and prevents starvation
(B) Only CPU utilization
(C) Only disk throughput
(D) Only memory allocation
Answer: (A) Fairness and prevents starvation
Q#32: Multilevel queue disadvantage:
(A) Fixed assignment may reduce flexibility
(B) Only memory usage
(C) Only CPU efficiency
(D) Only I/O performance
Answer: (A) Fixed assignment may reduce flexibility
Q#33: Multilevel feedback queue solves:
(A) Starvation and dynamic behavior of processes
(B) Only memory issues
(C) Only CPU idle
(D) Only disk scheduling
Answer: (A) Starvation and dynamic behavior of processes
Q#34: Time quantum too small in round-robin causes:
(A) Excessive context switching
(B) Low CPU utilization
(C) Starvation
(D) Memory overflow
Answer: (A) Excessive context switching
Q#35: Time quantum too large in round-robin causes:
(A) Poor response time
(B) Starvation
(C) CPU idle
(D) Disk overload
Answer: (A) Poor response time
Q#36: Preemptive scheduling can improve:
(A) Responsiveness for interactive tasks
(B) Only disk throughput
(C) Only CPU idle
(D) Only memory usage
Answer: (A) Responsiveness for interactive tasks
Q#37: CPU-bound processes favor:
(A) Long CPU bursts and non-preemptive scheduling
(B) Short I/O bursts
(C) Only round-robin
(D) Only SJF preemptive
Answer: (A) Long CPU bursts and non-preemptive scheduling
Q#38: I/O-bound processes favor:
(A) Short CPU bursts and preemptive scheduling
(B) Long CPU bursts
(C) FCFS only
(D) SJF non-preemptive only
Answer: (A) Short CPU bursts and preemptive scheduling
Q#39: Convoy effect occurs because:
(A) Long process delays shorter processes in FCFS
(B) Priority scheduling fails
(C) Round-robin fails
(D) SJF fails
Answer: (A) Long process delays shorter processes in FCFS
Q#40: Throughput can be increased by:
(A) Keeping CPU busy and reducing idle time
(B) Only memory allocation
(C) Only I/O scheduling
(D) Only file management
Answer: (A) Keeping CPU busy and reducing idle time
Q#41: CPU utilization goal is typically:
(A) 40-90% in modern systems
(B) 100% always
(C) Only memory usage
(D) Only disk access
Answer: (A) 40-90% in modern systems
Q#42: Scheduling decisions can be made:
(A) When a process switches from running to waiting, ready, or terminates
(B) Only on process creation
(C) Only on disk access
(D) Only on memory allocation
Answer: (A) When a process switches from running to waiting, ready, or terminates
Q#43: Preemptive scheduling is suitable for:
(A) Time-sharing and interactive systems
(B) Only batch systems
(C) Only disk management
(D) Only CPU-bound processes
Answer: (A) Time-sharing and interactive systems
Q#44: Non-preemptive scheduling is suitable for:
(A) Batch systems
(B) Time-sharing systems
(C) Interactive systems
(D) Real-time systems
Answer: (A) Batch systems
Q#45: CPU scheduling improves:
(A) System performance and resource utilization
(B) Only memory allocation
(C) Only disk throughput
(D) Only file access
Answer: (A) System performance and resource utilization
Q#46: FCFS average waiting time can be minimized by:
(A) Arranging processes by burst time
(B) Random order
(C) Only priority
(D) Only round-robin
Answer: (A) Arranging processes by burst time
Q#47: Preemptive algorithms may cause:
(A) Higher context switching overhead
(B) Lower CPU utilization
(C) Only memory issues
(D) Only disk errors
Answer: (A) Higher context switching overhead
Q#48: Non-preemptive algorithms are:
(A) Simple and low-overhead
(B) Complex and high-overhead
(C) Only memory-efficient
(D) Only I/O efficient
Answer: (A) Simple and low-overhead
Q#49: Starvation can be handled by:
(A) Aging
(B) Ignoring priorities
(C) FCFS only
(D) Round-robin only
Answer: (A) Aging
Q#50: Overall purpose of CPU scheduling:
(A) Maximize CPU utilization, minimize waiting and response times, ensure fairness
(B) Only memory allocation
(C) Only disk usage
(D) Only file management
Answer: (A) Maximize CPU utilization, minimize waiting and response times, ensure fairness