Exams › GATE › Technical

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every time unit and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?

1. This algorithm is equivalent to the first-come-first-serve algorithm.
2. This algorithm is equivalent to the round-robin algorithm.
3. This algorithm is equivalent to the shortest-job-first algorithm.
4. This algorithm is equivalent to the shortest-remaining-time-first algorithm.

Correct answer: This algorithm is equivalent to the first-come-first-serve algorithm.

Solution

The algorithm assigns priorities based on waiting time, which means that processes are scheduled in the order they arrive without preemption, similar to first-come-first-serve. Since all processes start with the same priority and there are no I/O operations, the order of execution remains unchanged, making it equivalent to FCFS.

Related GATE Technical questions

• The truth table X Y f(X,Y) 0 0 0 0 1 0 1 0 1 1 1 1 represents the Boolean function
• The decimal value 0.5 in IEEE single precision floating point representation has
• A process executes the code fork(); fork(); fork(); The total number of child processes created is
• The protocol data unit (PDU) for the application layer in the Internet stack is
• Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a context-free language, then is L̄ also context-free? 3) If L is a regular language, then is L̄ also regular? 4) If L is a recursive language, then is L̄ also recursive?
• A binary operation ⊕ on a set of integers is defined as x ⊕ y = x² × y². Which one of the following statements is TRUE about ⊕?

⚔️ Practice GATE Technical free + battle 1v1 →