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 | | C | 5 | 4 | | D | 7 | 6 | | E | 10 | 3 | Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in msec) is __________.

Process Management-I GATE 2014 Question #9864 with Solution

GATE 2014 · session-1

Operating SystemsProcess Management-ImediumNAT2 marks

Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.

Using the shortest remaining time first scheduling algorithm, the average process turnaround time (in msec) is __________.

Your numerical answer

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

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…

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

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…

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

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

Saved progressKeep answers, mock results and completion history across devices.

Adaptive practiceGet questions matched to your recent accuracy and difficulty level.

Bookmarks and notesBuild a personal revision list and record why a question was difficult.

Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.