1
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will result in the maximum throughput?.
A
Round -Robin
B
Shortest -Job -First
C
Highest-Response-Ratio-Next
D
First -Come-First-Served
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
A CPU has two modes-privileged and non-privileged. In order to change the mode from privileged to non-privileged
A
A hardware interrupt is needed
B
A software interrupt is needed
C
A privileged instruction (which does not generate an interrupt) is needed.
D
A non-privileged instruction (which does not generate an interrupt) is needed.
3
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
System calls are usually invoked by using:
A
A software interrupt
B
Polling
C
An indirect jump
D
A privileged instruction
4
GATE CSE 1998
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is an example of spooled device?
A
The terminal used to enter the input data for the C program being executed.
B
An output device used to print the output of a number of jobs.
C
The secondary memory device in a virtual storage system.
D
The swapping area on a disk used by the swapper.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12