List of top Computer Science Questions on CPU Scheduling

Cooperating processes require an Interprocess Communication mechanism. This works on which of the following fundamentals?
• [A.] Shared Memory
• [B.] Cascading Termination
• [C.] Message Passing
• [D.] Cooperating

Cooperating processes require an Interprocess Communication mechanism. This works on which of the following fundamentals?
• [A.] Shared Memory
• [B.] Cascading Termination
• [C.] Message Passing
• [D.] Cooperating

Which one of the following CPU scheduling algorithms cannot be preemptive?

Which of the following scheduler/schedulers is/are also called CPU scheduler?
(A) Short Term Scheduler
(B) Long Term Scheduler
(C) Medium Term Scheduler
(D) Asymmetric Scheduler
Choose the correct answer from the options given below:

Which CPU scheduling algorithm prefers the process with the shortest burst time?

Match List-I with List-II:
\[\begin{array}{|c|c|}\hline \textbf{List-I} & \textbf{List-II} \\ \hline (A)\ \text{FCFS} & (III)\ \text{Often long average waiting time} \\ \hline (B)\ \text{Round Robin} & (I)\ \text{FCFS + preemption} \\ \hline (C)\ \text{Multi-level queue scheduling} & (IV)\ \text{Permanent assignment of processes to one specific queue} \\ \hline (D)\ \text{Multi-level Feedback Queue} & (II)\ \text{Allows the processes to move between queues} \\ \hline \end{array}\] Choose the correct answer from the options given below: