A) 8
B) 10
D) 7
A) Process can move to a different classified ready queue
B) Classification of the ready queue is permanent
C) Processes are not classified into groups
D) None of the mentioned
A) Shortest job scheduling algorithm
B) Round-robin scheduling algorithm
C) Priority scheduling algorithm
D) Multilevel queue scheduling algorithm
A) CPU is allocated to the process with the highest priority
B) CPU is allocated to the process with the lowest priority
C) Equal-priority processes, cannot be scheduled
D) None of these
A) First-come first-served scheduling
B) Shortest job scheduling
C) Priority scheduling
D) None of these