CPU Scheduling Basics

What is Round Robin Scheduling?

• Round Robin Scheduling is a type of food delivery service

• Round Robin Scheduling is a popular dance move

• Round Robin Scheduling is a computer hardware component

• Round Robin Scheduling is a CPU scheduling algorithm where each process is assigned a fixed time unit in a cyclic way.

Explain the concept of Priority Scheduling.

• Priority Scheduling is a scheduling algorithm where all processes are executed simultaneously.

• Priority Scheduling is a scheduling algorithm where each process is assigned a priority.

• Priority Scheduling is a scheduling algorithm where the process with the lowest priority is executed first.

• Priority Scheduling is a scheduling algorithm where processes are executed randomly without any order.

How does Shortest Job First Scheduling work?

• Shortest Job First Scheduling selects the process with the largest execution time to execute first.

• Shortest Job First Scheduling selects the process with the highest priority to execute first.

• Shortest Job First Scheduling selects the process with the smallest execution time to execute first.

• Shortest Job First Scheduling selects the process with the most memory usage to execute first.

Describe Multi-level Queue Scheduling.

• Multi-level queue scheduling only uses one scheduling algorithm for all processes.

• Multi-level queue scheduling involves dividing processes into multiple queues with different priority levels, each queue having its own scheduling algorithm.

• Multi-level queue scheduling does not consider priority levels for processes.

• Multi-level queue scheduling involves dividing processes into a single queue with the same priority level.

What is First Come First Serve Scheduling?

• First Come Last Serve Scheduling executes the processes based on their arrival time.

• First Serve First Come Scheduling executes the processes based on their arrival time.

• Last Come First Serve Scheduling executes the processes based on their arrival time.

• First Come First Serve Scheduling executes the processes based on their arrival time.

Explain the concept of Multi-level Feedback Queue Scheduling.

• Uses multiple queues with different priorities, allowing processes to move between queues based on their execution time.

• Multi-level Feedback Queue Scheduling does not consider the execution time of processes.

• Multi-level Feedback Queue Scheduling uses a single queue with fixed priorities for all processes.

• Multi-level Feedback Queue Scheduling allows processes to execute simultaneously in the same queue.

What is the time quantum in Round Robin Scheduling?

• The time quantum is typically between 10 to 100 milliseconds.

• The time quantum is fixed at 5 milliseconds.

• The time quantum is typically less than 1 millisecond.

• The time quantum is always 1 second.

How are priorities assigned in Priority Scheduling?

• Based on the process size

• Randomly assigned priorities

• Based on the priority value associated with each process

• Assigned in alphabetical order

What is the main advantage of Shortest Job First Scheduling?

• Maximizes average waiting time

• Minimizes average waiting time

• Increases CPU utilization

• Requires less context switching

What is the main difference between preemptive and non-preemptive Priority Scheduling?

• Preemptive Priority Scheduling allows the scheduler to interrupt a process if a higher priority process arrives, while Non-preemptive Priority Scheduling does not allow such interruptions.

• Preemptive Priority Scheduling always gives priority to the process with the highest priority, while Non-preemptive Priority Scheduling may allow lower priority processes to continue running.

• Preemptive Priority Scheduling is more efficient in terms of response time compared to Non-preemptive Priority Scheduling.

• Non-preemptive Priority Scheduling is simpler to implement than Preemptive Priority Scheduling.