Solution :
732220260311083943 Correct Answer : Non-preemptive

Description -

Non-preemptive is the correct answer.

Understanding HRRN Scheduling

• Highest Response Ratio Next (HRRN) is a non-preemptive scheduling algorithm. Once a process is allocated the CPU, it runs to completion without interruption.
• How it works: When the CPU becomes free, the algorithm calculates the response ratio for all processes waiting in the ready queue and picks the one with the highest ratio.
• The Formula:
  \(\text{Response Ratio}=\frac{\text{Waiting Time}+\text{Burst Time}}{\text{Burst Time}}\)
• Why it's unique: It prevents starvation (a common issue in Shortest Job First). As a long process waits longer, its Waiting Time increases, which automatically pumps up its response ratio until it becomes high enough to claim the CPU.

Solution :
220820260311083845 Correct Answer : Circular queue

Description -

In Round Robin scheduling, the ready queue is generally implemented as a Circular queue.

Why a Circular Queue?

• Cyclic Turn Allocation: The Round Robin algorithm allocates a fixed time slice (or time quantum) to each process in a cyclic manner.
• FIFO with Wrap-around: When a process finishes its time slice before completion, it is preempted and shifted to the end of the queue, while the next process is picked from the front. A circular queue connects the last position back to the first position, making this continuous rotation highly efficient without wasting memory space.

Solution :
321520260311083745 Correct Answer : Preemptive

Description -

Round Robin scheduling algorithm is: Preemptive

Why Preemptive?

• Time Quantum: The algorithm assigns a fixed time slice (time quantum) to each process.
• Forced Interruption: If a process is still running when its time slice expires, the operating system forcibly interrupts (preempts) it, moves it to the back of the ready queue, and gives the next process a turn.

Solution :
146120260311083645 Correct Answer : Starvation

Description -

SRTF (Shortest Remaining Time First) scheduling can cause: Starvation

Why Starvation?

• Continuous Arrival of Short Jobs: SRTF is a preemptive algorithm that always chooses the process with the shortest remaining processing time.
• Longer Jobs get Delayed: If short processes keep entering the ready queue continuously, a longer process will never get a chance to execute. This indefinite delay of longer processes is known as starvation (or starvation effect).

Solution :
497920260311083553 Correct Answer : Process Control Block

Description -

When a process is removed from the CPU in SRTF, its context is saved in the: Process Control Block

Why the Process Control Block (PCB)?

• Context Switching: When a process is preempted (removed from the CPU), the operating system performs a context switch.
• State Preservation: To resume the process later from the exact point it was interrupted, the OS stores all its execution details—such as CPU registers, the program counter, and process state—inside its unique Process Control Block (PCB).

Solution :
298720260311083446 Correct Answer : Process with shortest remaining burst time

Description -

In SRTF, the process that gets the CPU is the: Process with shortest remaining burst time

Why this option?

• Core Definition: SRTF stands for Shortest Remaining Time First. It is the preemptive version of the Shortest Job First (SJF) scheduling algorithm.
• Preemptive Choice: Whenever a new process arrives in the ready queue, the operating system compares the remaining burst time of the currently running process with the burst times of the newly arrived processes. The CPU is immediately allocated to the process that requires the least amount of time to complete its execution.

Solution :
783220260311083316 Correct Answer : Future CPU burst time is unknown

Description -

Correct answer is  Future CPU burst time is unknown

Why this option?

• The Reality of Processes: In a real operating system, it is impossible to know exactly how long a process will run (its burst time) before it actually executes.
• Prediction Estimation: Because the future CPU burst time is unknown, the operating system must predict it. It usually does this by calculating an exponential average of the process's past CPU burst times to guess how long the next one will take.

Solution :
811220260311083045 Correct Answer : Both preemptive and non-preemptive

Description -

SJF scheduling can be: Both preemptive and non-preemptive

Why this option?

• Non-preemptive SJF: Once the CPU is allocated to a process, it holds the CPU until it terminates or switches to a waiting state.
• Preemptive SJF: If a new process arrives with a CPU burst length less than the remaining time of the current executing process, the current process is preempted. This preemptive variation is formally known as Shortest Remaining Time First (SRTF).

Solution :
318620260311082953 Correct Answer : Burst time

Description -

SJF scheduling selects the process based on: Burst time

Why this option?

• Core Criteria: SJF stands for Shortest Job First. The algorithm evaluates the CPU burst time (the execution time required) of all available processes in the ready queue.
• Selection Policy: It always picks the process that has the smallest (shortest) burst time to execute next, as this minimizes the average waiting time for the entire system.

Solution :
900620260311082757 Correct Answer : Starvation

Description -

The Convoy Effect can lead to: Starvation (specifically, temporary starvation of short processes).

Why this option?

• The Convoy Effect: This phenomenon occurs primarily in First-Come, First-Served (FCFS) scheduling when a very long, CPU-bound process gets ahead of multiple short, I/O-bound processes.
• Resource Blockage: The short processes are forced to wait for a prolonged period in the ready queue while the giant process finishes its execution. While not a permanent deadlock, this results in a high average waiting time and temporary starvation for the smaller jobs, as well as poor device utilization.

Solution :
620820260311082725 Correct Answer : All of the above

Description -

The Convoy Effect increases: All of the above

The Convoy Effect occurs in FCFS (First-Come, First-Served) scheduling when short processes get stuck behind a single, massive CPU-bound process. This bottleneck impacts all performance metrics:

• Waiting time increases because the short processes must wait a very long time in the ready queue for the giant job to finish.
• Response time increases because it takes much longer for those blocked short processes to get the CPU for the very first time.
• Turnaround time increases because the overall time from submission to completion skyrockets for all subsequent processes due to the initial delays.

Solution :
241120260311082603 Correct Answer : Short processes

Description -

The processes that suffer most due to the convoy effect are: Short processes

• The Bottleneck: The convoy effect happens in First-Come, First-Served (FCFS) scheduling when a single, massive CPU-bound process takes over the CPU.
• The Victims: Multiple short processes (often I/O-bound jobs that only need a tiny fraction of CPU time) get stuck sitting in the ready queue behind this giant job. They end up suffering from massive, unnecessary delays just to run a short execution burst.

Solution :
614120260311082441 Correct Answer : FCFS scheduling

Description -

If the time quantum in Round Robin becomes very large, it behaves like: FCFS scheduling

• No Preemption: When the time quantum is larger than the longest burst time of any process in the queue, no process will be preempted due to its time running out.
• First-Come, First-Served: Each process will simply run to its absolute completion in the exact order it arrived, which is exactly how First-Come, First-Served (FCFS) scheduling operates.

Solution :
663020260311082340 Correct Answer : Burst time of previous processes

Description -

Waiting time in FCFS depends mainly on: Burst time of previous processes

• First-Come, First-Served Policy: In FCFS scheduling, processes are executed in the exact order they arrive.
• The Dependency: A process cannot start its execution until all the processes that arrived before it have completely finished running. Therefore, the waiting time of any given process is determined directly by the cumulative burst times (execution times) of the previous processes ahead of it in the queue. This is also the core mechanic behind the Convoy Effect.

Solution :
175420260311082303 Correct Answer : Batch systems

Description -

FCFS scheduling is most suitable for: Batch systems

• Non-Preemptive & Simple: First-Come, First-Served (FCFS) processes jobs strictly in the order they arrive without interruption or complex prioritization.
• Long Jobs are Tolerated: Batch systems handle background tasks and heavy data processing where quick user interaction is not required, making the long waiting times and convoy effects of FCFS completely acceptable.

Solution :
871120260311082155 Correct Answer : Large process runs before small processes

Description -

The convoy effect occurs when: Large process runs before small processes

• The Core Mechanism: The convoy effect happens in First-Come, First-Served (FCFS) scheduling when a single large (CPU-bound) process arrives first and occupies the CPU.
• The Bottleneck: Multiple small (I/O-bound) processes arrive right after it and are forced to wait in the ready queue for a prolonged period, leading to poor CPU and device utilization.

Solution :
423820260311082101 Correct Answer : Convoy effect

Description -

A major disadvantage of FCFS is the: Convoy effect

• The Inherent Flaw: Because First-Come, First-Served (FCFS) is non-preemptive and schedules processes strictly by arrival time, a single long, CPU-bound process can hold up all subsequent short processes.
• Impact: This specific phenomenon—the Convoy effect—leads to highly inflated average waiting times and poor CPU/device utilization, making it the most prominent, defining drawback of FCFS scheduling.
  (Note: FCFS does not cause Starvation, because every process in the queue will eventually get its turn to execute once the processes ahead of it finish).

Solution :
673120260311081940 Correct Answer : Arrival time

Description -

The factor that determines the order of execution in FCFS is: Arrival time

• Core Definition: FCFS stands for First-Come, First-Served.
• First In, First Out: The algorithm processes jobs strictly based on the order in which they arrive in the ready queue. The process with the earliest arrival time gets allocated to the CPU first.

Solution :
536020260311081852 Correct Answer : Non-preemptive scheduling

Description -

FCFS is mainly classified as: Non-preemptive scheduling

Why Non-preemptive?

• No Forced Interruptions: In First-Come, First-Served (FCFS) scheduling, once the CPU has been allocated to a process, that process keeps control of the CPU until it either terminates or yields control voluntarily (e.g., by requesting I/O).
• Strict Order: The operating system cannot forcibly interrupt a running process to give the CPU to a newly arrived process, regardless of how short or high-priority that new process might be.

Solution :
89920260311081803 Correct Answer : FIFO

Description -

Correct answer is FIFO

• First In, First Out: FCFS stands for First-Come, First-Served.
• Queue Alignment: It operates exactly like a standard checkout line or a FIFO queue dataset structure. The process that enters the ready queue first is the very first one to be assigned to the CPU, and subsequent processes are handled strictly in their arrival order.