1
GATE CSE 2006
MCQ (Single Correct Answer)
+1
-0.3
Consider three $$CPU$$-intensive process, which require $$10,20$$ and $$30$$ time units and arrive at times $$0,2$$ and $$6$$ respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.
A
$$1$$
B
$$2$$
C
$$3$$
D
$$4$$
2
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
Consider the following statements with respect to user-level threads and kernel-supported threads.
i) Context switch is faster with kernel- supported threads
ii) For user-level threads, a system call can block the entire process
iii) Kernel-supported threads can be scheduled independently
iv) Use-level threads are transparent to the kernel

Which of the above statements are true?

A
(ii), (iii) & (iv) only
B
(ii) & (iii) only
C
(i) & (iii) only
D
(i) & (ii) only
3
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
Which of the following scheduling algorithms is non-preemptive?
A
Round Robin
B
First-In First-Out
C
Multilevel Queue Scheduling
D
Multilevel Queue Scheduling with Feedback
4
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
A processor needs software interrupt to
A
Test the interrupt system of the processor
B
Implement co-routines
C
Obtain system services which need execution of privileged instructions
D
Return from subroutine
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