Gate Questions Set-4

GATE-2002 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 Ans:-Option-B The optimal page replacement algorithm...

Read This Post

Gate Questions Set-3

GATE-1998 Which of the following devices should get higher priority in assigning interrupts? (a) Hard disk (b) Printer (c) Keyboard (d) Floppy disk Ans:- Option-C GATE-1999 1. System calls are usually invoked by using       (a)a software interrupt (b) polling        (c) an indirect jump      (d) a privileged instruction Ans:- Option-A GATE-1999 2.  A multi-user, multi-processing operating system cannot be...

Read This Post

Gate Questions Set-2

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 Ans: option-B Explanation:-                     The round robin scheduling gives each process a fair time for processing. GATE-1995 Which...

Read This Post

Gate Questions Set-1

GATE-1992 1. At a particular time of computation the value of a counting semaphore is 7.     Then 20 P operations and 15 V operations were completed on this     semaphore. The resulting value of the semaphore is: (a) 42 (b) 2 (c) 7 (d) 12 Ans:- Option - B Explanation:-  The wait operation (P) decrements the semaphore value. The Signal operation(v) increments the semaphore value. The 20 P operation will decrements the semaphore value 20 times. The...

Read This Post