Category Archives: GATE CS

Following questions have been asked in GATE CS 2006 exam. 1) Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2,… Read More

Following questions have been asked in GATE CS 2006 exam. 1) Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive… Read More

Following questions have been asked in GATE CS 2007 exam. 1) A virtual memory system uses First In First Out (FIFO) page replacement policy and… Read More

Following questions have been asked in GATE CS 2007 exam.  1) Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors… Read More

Following questions have been asked in GATE 2008 CS exam. 1) A process executes the following code for (i = 0; i < n; i++)… Read More

Following questions have been asked in GATE 2008 CS exam. 1) The data blocks of a very large file in the Unix file system are… Read More

Following questions have been asked in GATE 2009 CS exam. 1) In the following process state transition diagram for a uniprocessor system, assume that there… Read More

Following questions have been asked in GATE 2009 CS exam. 1) In which one of the following page replacement policies, Belady’s anomaly may occur? (A)… Read More

Following questions have been asked in GATE CS exam. 1) Let the time taken to switch between user and kernel modes of execution be t1… Read More

Following questions have been asked in GATE 2011 CS exam. 1) A thread is usually defined as a ‘light weight process’ because an operating system… Read More

Following questions have been asked in GATE 2012 exam. 1. A process executes the code fork (); fork (); fork (); The total number of… Read More