1
GATE CSE 1996
+2
-0.6
Four jobs to be executed on a single processor system arrive at time $${0^ + }$$ in the order $$A, B, C, D.$$ their burst $$CPU$$ time requirements are $$4, 1, 8, 1$$ time units respectively. The completion time of A under round robin scheduling with time slice of one time units.
A
$$10$$
B
$$4$$
C
$$8$$
D
$$9$$
2
GATE CSE 1995
+2
-0.6
The sequence $$.........$$ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the $$CPU$$ idle for $$..........$$ Unit (s) of time A
$$\left\{ {3,2,1} \right\},1$$
B
$$\left\{ {2,1,3} \right\},0$$
C
$$\left\{ {3,2,1} \right\},0$$
D
$$\left\{ {1,2,3} \right\},5$$
3
GATE CSE 1993
Subjective
+2
-0
The details of an interrupt cycle are shown in Figure Given that an interrupt input arrives every $$1$$ $$msec,$$ what is the percentage of the total time that the $$CPU$$ devotes for the main program execution.
4
GATE CSE 1993
+2
-0.6
Assume that the following jobs are to be executed on a single processor system.
Job Id CPU Burst Time
p 4
q 1
r 8
s 1
t 2

The jobs are assumed to have arrived at time $${0^ + }$$ and in the order $$p,q,r,s,t.$$ Calculate the departure time (completion time) for job $$p$$ if scheduling is round robin with time slice$$1.$$

A
$$4$$
B
$$10$$
C
$$11$$
D
$$12$$
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination