Understanding Process Scheduling Concepts

Which of the following is NOT a valid process state in an operating system?

• Running

• Ready

• Blocked

• Terminated

In the Round Robin scheduling algorithm, what is the primary factor that determines the time each process gets to execute?

• Process priority

• Time quantum

• Process size

• Arrival time

Which scheduling algorithm selects the process with the shortest execution time first?

• Round Robin

• Shortest Job First

• First Come First Served

• Shortest Remaining Time First

In the First Come First Served (FCFS) scheduling algorithm, how are processes scheduled?

• Based on priority

• In the order of their arrival

• Based on shortest execution time

• In a round-robin manner

Which of the following scheduling algorithms can cause starvation?

• Round Robin

• First Come First Served

• Shortest Job First

• None of the above

In the context of process scheduling, what does the term "context switch" refer to?

• Switching from one process state to another

• Switching the CPU from one process to another

• Switching the memory allocation of a process

• Switching the priority of a process

Which scheduling algorithm is preemptive and selects the process with the shortest remaining time to execute next?

• Round Robin

• Shortest Job First

• First Come First Served

• Shortest Remaining Time First

In Round Robin scheduling, if the time quantum is too large, the algorithm behaves like which other scheduling algorithm?

• Shortest Job First

• First Come First Served

• Shortest Remaining Time First

• Priority Scheduling

What is the main disadvantage of the First Come First Served scheduling algorithm?

• Complexity in implementation

• Possibility of starvation

• Long average waiting time

• Requires a time quantum

In the Shortest Remaining Time First scheduling algorithm, what happens when a new process arrives with a shorter remaining time than the current process?

• The new process is added to the end of the queue

• The current process continues until completion

• The current process is preempted, and the new process is executed

• The new process is ignored