Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

Turnaround Time

GATE CSE & IT · Operating Systems - CPU Scheduling · 1988-2025

8
PYQs
63%
keyed
0
elite explanations
7
years appeared

Study anchor

Source-book anchor pending for this concept.

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2025 Q26

Processes P1, P2, P3, P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds respectively. Shortest Re...

mediumanswer key
2025 PYQ

Processes $P 1, P 2, P 3, P 4$ arrive in that order at times $0,1,2$, and 8 milliseconds respectively, and have execution times of $10,13,6$, and 9 milliseconds respectively. Short...

mediumanswer keybasic explanation
2021 PYQ

Which of the following statement(s) is/are correct in the context of CPU scheduling?

mediumanswer keybasic explanation
2016 PYQ

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time f...

medium
2015 PYQ

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time? Process Arrival Time Processing Time A 0 3...

mediumanswer key
2014 PYQ

Consider the following set of processes that need to be scheduled on a single $$CPU.$$ All the times are given in milliseconds. Process Name Arrival Time Execution Time A 0 6 B 3 2...

medium
2006 PYQ

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 remai...

mediumanswer key
1988 PYQ

State an undesirable characteristic of each of the following criteria for measuring performance of an operating system: (a) Turn around time. (b) Waiting time.

easy