GATEverse Practice, past papers & mock tests
GATE 2027: 115 days Sign in Create account
GATE 2014 · session-3
Operating SystemsProcess Management-ImediumNAT2 marks
An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with their arrival times and CPU burst times (in milliseconds):
ProcessArrival TimeBurst Time
P1012
P224
P336
P485
The average waiting time (in milliseconds) of the processes is __________.
Save your progress

Related Operating Systems PYQs

GATE 2014 · SET - 2

Consider the following set of processes with arrival times and CPU burst times: P1: Arrival = 0, Burst = 8 P2: Arrival = 1, Burst …

GATE 2014 · SET - 1

A computer system uses 46-bit virtual addresses, 32-bit physical addresses, and a page size of 8 KB. What is the number of bits in…

GATE 2014 · SET - 1

In a Resource Allocation Graph (RAG) with single instances of each resource type, a directed cycle in the graph is:

GATE 2014 · session-1

Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of di…

GATE 2014 · session-1

Which one of the following statements about user-level and kernel-level threads is FALSE?

GATE 2014 · session-1

An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, …