Showing posts with label GATE questions on Operating Systems. Show all posts
Showing posts with label GATE questions on Operating Systems. Show all posts
Tuesday, January 22, 2013
GATE Questions - OS - Synchronization
Previous GATE questions with solutions on Operating Systems (Synchronization) - CS/IT
GATE-1996
1. A critical section is a program segment
(a) which should run in a certain specified amount of time
(b) which avoids deadlocks
(c) where shared resources are accessed
(d) which must be enclosed by a pair of semaphore operations, P and V
Ans: option (c)
GATE-1996
1. A critical section is a program segment
(a) which should run in a certain specified amount of time
(b) which avoids deadlocks
(c) where shared resources are accessed
(d) which must be enclosed by a pair of semaphore operations, P and V
Ans: option (c)
Monday, January 21, 2013
GATE - OS - Process Concepts
Previous GATE questions with solutions on Operating Systems (Process Concepts) - CS/IT
GATE-1996
1. The process state transition diagram in Fig.1.8 is representative of
(a) a batch operating system
(b) an operating system with a preemptive scheduler
(c) an operating system with a non-preemptive scheduler
(d) a uni-programmed operating system.
Ans: option (b)
Explanation:
If there is a transition from Running State to ready State then the state diagram is the representative of an operating system with a preemptive scheduler.
GATE-1996
1. The process state transition diagram in Fig.1.8 is representative of
(a) a batch operating system
(b) an operating system with a preemptive scheduler
(c) an operating system with a non-preemptive scheduler
(d) a uni-programmed operating system.
Ans: option (b)
Explanation:
If there is a transition from Running State to ready State then the state diagram is the representative of an operating system with a preemptive scheduler.
Sunday, January 20, 2013
GATE Questions - OS - CPU Scheduling
Previous GATE questions with solutions on Operating Systems (CPU Scheduling) - CS/IT
GATE-1995
1. Which scheduling policy is most suitable for a time-shared operating systems?
(a) Shortest Job First (b) Round Robin
(c) First Come First Server (d) Elevator
GATE-1995
1. Which scheduling policy is most suitable for a time-shared operating systems?
(a) Shortest Job First (b) Round Robin
(c) First Come First Server (d) Elevator
Subscribe to:
Posts (Atom)