CPU Scheduling – Scheduling algorithms (FCFS, SJF, Priority, Round Robin, Multilevel Queue)

    Question 1: OS - CPU Scheduling Definition

    What is the primary purpose of CPU scheduling in operating systems?

    Question 2: OS - First-Come, First-Served (FCFS)

    How does the First-Come, First-Served (FCFS) scheduling algorithm work?

    Question 3: OS - FCFS Limitation

    What is a major disadvantage of FCFS scheduling?

    Question 4: OS - Shortest Job First (SJF)

    What is the key characteristic of the Shortest Job First (SJF) scheduling algorithm?

    Question 5: OS - Preemptive vs Non-Preemptive SJF

    How does preemptive SJF (also known as Shortest Remaining Time First, SRTF) differ from non-preemptive SJF?

    Question 6: OS - Priority Scheduling

    How does priority scheduling determine which process executes next?

    Question 7: OS - Problem with Priority Scheduling

    What is the major drawback of priority scheduling?

    Question 8: OS - Round Robin Scheduling

    What is the main idea behind Round Robin (RR) scheduling?

    Question 9: OS - Multilevel Queue Scheduling

    How does a Multilevel Queue (MLQ) scheduling algorithm work?

    Question 10: OS - Choosing a Scheduling Algorithm

    Which factor is most important when choosing a CPU scheduling algorithm?