Which scheduling algorithm allows a process to be interrupted before completion? A) Shortest Job First B) Non-Preemptive Scheduling C) Preemptive Scheduling D) First Come First Serve

C) Preemptive Scheduling

True or False: In non-preemptive scheduling, a process can be interrupted by a higher priority process.

False. In non-preemptive scheduling, once a process is allocated CPU time, it runs to completion or until it waits.

Fill in the blank: The ______ scheduling algorithm is designed for time-sharing systems, where each process is assigned a fixed time quantum.

Round Robin

What is the main disadvantage of First Come First Serve (FCFS) scheduling?

It can cause long waiting times, especially when a long process is at the front of the queue.

Riddle: I prioritize based on how soon I can respond, balancing waiting time and burst time. What am I?

Highest Response Ratio Next (HRRN)

Which scheduling algorithm can lead to starvation for longer processes if shorter processes keep arriving? A) Shortest Job First B) Longest Job First C) Round Robin D) Highest Response Ratio Next

A) Shortest Job First

Fill in the blank: The ______ scheduling method uses multiple queues, allowing processes to move between them based on their behavior.

Multilevel Feedback Queue

True or False: In the Shortest Remaining Time First (SRTF) scheduling, the CPU is allocated to the process that has the longest remaining time.

False. SRTF allocates the CPU to the process with the shortest remaining time.

What is the primary goal of process scheduling in operating systems?

Maximize CPU utilization and ensure fair allocation of resources.

Riddle: I keep track of the status of all devices and manage which one is active or inactive. What am I?

I/O Traffic Controller