Process Scheduling Basics

What is the purpose of process scheduling in an operating system?

• To decrease the efficiency of the operating system

• To increase the power consumption of the system

• To randomly assign CPU time to processes

• The purpose of process scheduling in an operating system is to efficiently manage the execution of multiple processes by allocating CPU time to each process in a fair and timely manner.

Explain the concept of process states in process scheduling.

• Process states only include running and terminated states.

• Process states are fixed and unchangeable during execution.

• Process states do not impact process scheduling.

• Process states in process scheduling refer to the different stages a process goes through during its execution.

How does Round Robin Scheduling algorithm work?

• Round Robin Scheduling algorithm works by executing processes based on their arrival time

• Round Robin Scheduling algorithm works by assigning a priority to each process

• Round Robin Scheduling algorithm works by assigning a fixed time unit per process called time quantum. Each process is executed for the specified time quantum, and if it is not completed, it is moved to the end of the queue. This process continues until all processes are completed.

• Round Robin Scheduling algorithm works by executing processes in a random order

What is Priority Scheduling and how is it different from other scheduling algorithms?

• Priority Scheduling guarantees fairness among all processes.

• Priority Scheduling always executes the process with the longest burst time first.

• Priority Scheduling is similar to Round Robin in terms of process selection.

• Priority Scheduling selects the process to execute based on priority levels, unlike other algorithms that follow fixed orders like FCFS or Round Robin.

Describe the First Come First Serve (FCFS) scheduling algorithm.

• FCFS prioritizes processes based on their size

• FCFS scheduling algorithm schedules processes based on their arrival time, with the process that arrives first being executed first.

• FCFS schedules processes based on their completion time

• FCFS executes processes randomly

What are the advantages of Round Robin Scheduling?

• Complex implementation, encourages starvation, unfair

• Simple implementation, prevents starvation, ensures fairness

Discuss the drawbacks of Priority Scheduling.

• Inefficient utilization of resources

• Starvation of lower priority tasks and neglect of lower priority tasks.

• Increased context switching

• Favoritism towards high priority tasks

How does the operating system determine the priority of a process in Priority Scheduling?

• Randomly selecting a process

• Alphabetical order of process names

• Based on the priority value assigned to each process

• Based on the process size

The strategy of allowing processes that are logically runnable to be temporarily suspended is called

• preemptive scheduling

• non preemptive scheduling

• shortest job first

• first come first served

Which is not a process state?

• waiting

• terminated

• blocked

• redirected