Exams › GATE › Technical

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?

1. Shortest remaining time first
2. Round-robin with time quantum less than the shortest CPU burst
3. Uniform random
4. Highest priority first with priority proportional to CPU burst length

Correct answer: Shortest remaining time first

Solution

Shortest remaining time first (SRTF) minimizes the average waiting time by always selecting the process with the least remaining CPU burst time, allowing shorter processes to complete quickly and reducing the waiting time for subsequent processes.

Related GATE Technical questions

• We want to design a synchronous counter that counts the sequence 0-1-0-2-0-3 and then repeats. The minimum number of J-K flip-flops required to implement this counter is
• A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT (n refers to the number of items in the queue)?
• Consider the following C program. void f(int, short); void main() { int i = 100; short s = 12; short *p = &s; ________; // call to f() } Which one of the following expressions, when placed in the blank above, will NOT result in a type checking error?
• The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:
• Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increased by the same value, then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not change
• Consider the following C program. #include<stdio.h> void mystery(int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb = ptra; ptra = temp; } int main() { int a=2016, b=0, c=4, d=42; mystery(&a, &b); if (a < c) mystery(&c, &a); mystery(&a, &d); printf("%d ", a); } The output of the program is _________.

⚔️ Practice GATE Technical free + battle 1v1 →