1

GATE CSE 2020

Numerical

+2

-0.67

Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P

If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places) is _____.

_{1}, P_{2}, P_{3}, P_{4}.If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places) is _____.

Your input ____

2

GATE CSE 2019

Numerical

+2

-0.67

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below :

These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is _____.

These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling algorithm. If the average waiting time of the processes is 1 millisecond, then the value of Z is _____.

Your input ____

3

GATE CSE 2016 Set 2

Numerical

+2

-0

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

Process | Arrival Time | Burst Time |
---|---|---|

P_{1}P _{2}P _{3}P _{4} |
0 3 7 8 |
10 6 1 3 |

The average turn around time of these processes is milliseconds.

Your input ____

4

GATE CSE 2015 Set 3

MCQ (Single Correct Answer)

+2

-0.6

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 |

B | 1 | 6 |

D | 4 | 4 |

E | 6 | 2 |

Questions Asked from Process Concepts and Cpu Scheduling (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2019 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2012 (1)
GATE CSE 2011 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (2)
GATE CSE 2007 (1)
GATE CSE 2006 (2)
GATE CSE 2005 (1)
GATE CSE 2004 (1)
GATE CSE 2003 (1)
GATE CSE 2002 (2)
GATE CSE 2001 (1)
GATE CSE 1999 (2)
GATE CSE 1998 (1)
GATE CSE 1996 (1)
GATE CSE 1995 (1)
GATE CSE 1993 (2)
GATE CSE 1992 (1)
GATE CSE 1990 (1)
GATE CSE 1988 (1)

GATE CSE Subjects

Discrete Mathematics

Programming Languages

Theory of Computation

Operating Systems

Computer Organization

Database Management System

Data Structures

Computer Networks

Algorithms

Compiler Design

Software Engineering

Web Technologies

General Aptitude