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 2009
MCQ (Single Correct Answer)
+1
-0.3
A CPU generally handles an interrupt by executing an interrupt service routine
A
As soon as an interrupt is raised
B
By checking the interrupt register at the end of fetch cycle.
C
By checking the interrupt register after finishing the execution of the current instruction.
D
By checking the interrupt register at fixed time intervals.
2
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?

A
Context switch time is longer for kernel level threads than for user level threads.
B
User level threads do not need any hardware support.
C
Related kernel level threads can be scheduled on different processors in a multi-processor system.
D
Blocking one kernel level thread blocks all related threads.
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

A
$$P - 3,Q - 2,R - 1$$
B
$$P - 1,Q - 2,R - 3$$
C
$$P - 2,Q - 3,R - 1$$
D
$$P - 1,Q - 3,R - 2$$
4
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$$
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