Which of the following is NOT a CPU scheduling algorithm?

The correct answer is Option 1) Branch and bound.

Key Points

• Branch and Bound is an algorithm design technique used to solve optimization problems like the Travelling Salesman Problem, Knapsack Problem, etc. It is not a CPU scheduling algorithm.
• CPU scheduling algorithms determine the order in which processes are executed by the processor, especially in a multitasking environment.
• Some commonly used CPU scheduling algorithms include:
  • First Come, First Served (FCFS): Executes processes in the order they arrive.
  • Shortest Job Next (SJN): Picks the job with the shortest execution time next.
  • Round Robin (RR): Assigns a fixed time slice to each process in a cyclic order.

Additional Information

• CPU Scheduling is essential for managing process execution in multi-tasking systems, improving CPU utilization, and minimizing waiting and response time.
• Other advanced CPU scheduling algorithms include:
  • Priority Scheduling
  • Multilevel Queue Scheduling
  • Multilevel Feedback Queue Scheduling

Conclusion: Branch and Bound is not used in CPU scheduling; it belongs to the category of problem-solving algorithms in operations research and computer science.