Q81MediumMCQ
Dispatch latency is defined as:
GATE CSE · Operating Systems
Generate diverse GATE-level questions covering scheduling algorithms (FCFS, SJF, Round Robin, Priority), waiting time, turnaround time, response time, and Gantt chart analysis.
109 questions · 0 PYQs · 20 AI practice · GATE CSE 2027
Dispatch latency is defined as:
Consider the processes P1, P2, and P3 with arrival times 0, 1, and 3, and required time units 5, 7, and 4, respectively. The completion order under the policies FCFS and RR2 (round robin scheduling with a CPU quantum of 2 time units) are:
Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero. Consider the Longest Remaining Time First (LRTF) scheduling algorithm. In LRTF, ties are broken by giving priority to the process with the lowest process id. The average turn around time is:
An OS contains 10 identical processes that were initiated at the same time. Each process contains 15 identical requests, and each request consumes 20 msec of CPU time. A request is followed by an I/O operation that consumes 10 msec. The system consumes 2 msec in CPU scheduling overhead. For a time quantum of 20 msec, the response time of the first request of the last process is:
Consider a system with a multilevel queue: Queue 1 (RR, quantum=4) for interactive processes, Queue 2 (FCFS) for batch processes. A process in Queue 2 runs only when Queue 1 is empty. Batch process B1 arrives at t=0 with burst 10, interactive processes I1 (arrives at t=0, burst 3), I2 (arrives at t=2, burst 5), I3 (arrives at t=4, burst 2). When will batch process B1 complete?
Which of the following are characteristic features of a Multilevel Feedback Queue (MLFQ) scheduling algorithm?
In a preemptive priority scheduling, what is used to handle processes with equal priority?
Consider a multilevel queue scheduling algorithm with the following rules: There are two queues: an interactive (foreground) queue using RR with quantum = 4 time units, and a batch (background) queue using FCFS. Processes are dispatched alternately: one from the foreground queue, then one from the background queue, and so on. If a process from the background queue is running when a foreground process arrives, the background process is preempted. Determine which process order is correctly scheduled.
Which of the below arguments/statements about Round Robin (RR) and FIFO scheduling is NOT correct?
A computer has two processors, M1 and M2. Four processes P1, P2, P3, P4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the same time. The scheduler uses non-preemptive priority scheduling, with M1 using priorities: P1 > P3 > P2 > P4 (P1 is highest priority), and M2 using priorities: P2 > P3 > P4 > P1 (P2 is highest priority). A process is scheduled to a processor if the processor is free and no other process is waiting with higher priority. Ignore context switch time. What is the average waiting time of the processes in milliseconds (rounded to two decimals)?
Which scheduling algorithm gives minimum average waiting time?
A system uses RR scheduling with a time quantum of 10 ms. If the context switch overhead is 2 ms, and there are n processes in the ready queue, then the effective CPU utilization per process per quantum is:
Which scheduling algorithm is preemptive?
Which of the following statements about Shortest Job First (SJF) scheduling is/are TRUE?
(i) It provably minimizes the average waiting time for a set of processes.
(ii) It is a preemptive scheduling algorithm.
(iii) It cannot cause starvation for longer processes.
In the guaranteed scheduling method, the system promises to allocate CPU time to processes in proportion to a weight or fair share. This is most closely related to:
Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts using a non-preemptive SJF scheduler, the minimum achievable average waiting time for these three processes (rounded to the nearest integer) is ________ milliseconds.
Which scheduling algorithm is guaranteed to be free from starvation?
Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Which scheduling algorithm is best suited for interactive systems where quick response to user input is required?
A system uses a multilevel feedback queue with 3 priority levels: Q0 (quantum = 2 time units), Q1 (quantum = 4), Q2 (quantum = 8). A process is initially placed in Q0. If it uses its entire time quantum, it is demoted to the next lower queue. If it voluntarily relinquishes the CPU before its quantum expires, it remains at the same priority level. Scheduling within each queue is FCFS. Consider the following processes: P1 (burst = 12), P2 (burst = 4), P3 (burst = 18), all arriving at time 0. Draw the Gantt chart and compute the average turnaround time.
Want unlimited AI-generated Cpu Scheduling questions?
Sign up free and practice with adaptive difficulty — Easy, Medium, Hard. New questions every session.
Start practising for free →