Operating Systems
Process Concepts and Cpu Scheduling
Marks 1Marks 2
Synchronization and Concurrency
Marks 1Marks 2
Memory Management
Marks 1Marks 2Marks 5
File System IO and Protection
Marks 1Marks 2Marks 5
1
GATE CSE 1996
MCQ (Single Correct Answer)
+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
MCQ (Single Correct Answer)
+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 GATE CSE 1995 Operating Systems - Process Concepts and Cpu Scheduling Question 30 English
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 GATE CSE 1993 Operating Systems - Process Concepts and Cpu Scheduling Question 44 English
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
MCQ (Single Correct Answer)
+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
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization