1
GATE CSE 2010
MCQ (Single Correct Answer)
+1
-0.3
Which of the following statements are true?
$${\rm I}.$$ Shortest remaining time first scheduling may cause starvation
$${\rm II}.$$ Preemptive scheduling may cause starvation
$${\rm III}.$$ Round robin is better than $$FCFS$$ in terms of response time
$${\rm I}.$$ Shortest remaining time first scheduling may cause starvation
$${\rm II}.$$ Preemptive scheduling may cause starvation
$${\rm III}.$$ Round robin is better than $$FCFS$$ in terms of response time
2
GATE CSE 2009
MCQ (Single Correct Answer)
+1
-0.3
A CPU generally handles an interrupt by executing an interrupt service routine
3
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Group-1 contains some $$CPU$$ scheduling algorithms and Group-2 contains some applications. Match entries in Group-1 to entries in Group-2.
Group-1
(P) Gang Scheduling
(Q) Rate Monotonic Scheduling
(R) Fair Share Scheduling
Group-2
(1) Guaranteed Scheduling
(2) Real-time Scheduling
(3) Thread Scheduling
4
GATE CSE 2007
MCQ (Single Correct Answer)
+1
-0.3
Consider the following statements about user level threads and kernel level threads.
Which one of the following statements is FALSE?
Questions Asked from Process Concepts and Cpu Scheduling (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2023 (2)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2019 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2013 (1)
GATE CSE 2012 (1)
GATE CSE 2011 (3)
GATE CSE 2010 (1)
GATE CSE 2009 (1)
GATE CSE 2007 (2)
GATE CSE 2006 (1)
GATE CSE 2004 (1)
GATE CSE 2002 (1)
GATE CSE 2001 (3)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1996 (2)
GATE CSE 1995 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages