.
.
.
.

Gate2iit Youtube Channel

Operating System Previous Year Questions
GATE -1992 | OS | Which of the following is an example of a spooled device?
GATE - 1992 | OS | A computer system has 6 tape drives, with n process completing for
GATE - 1992 | OS | At a particular time of computation the value of a counting semaphore
GATE - 1993 | OS | Consider a system having m resources of the same type. These
GATE - 1994 | OS | A memory page containing a heavily used variable that was initialized
GATE - 1995 | OS | In a virtual memory system the address space specified by the address
GATE - 1995 | OS | Which scheduling policy is most suitable for a time shared operating
GATE - 1995 | OS | Which of the following page replacement algorithms suffers from
GATE - 1995 | OS | In a paged segmented scheme of memory management, the segment
GATE - 1995 | OS | Which of the following statements is true?
GATE - 1996 | OS | Four jobs to be executed on a single processor system arrive at time
GATE - 1996 | OS | A solution to the Dining Philosophers Problem which avoids deadlock is
GATE - 1996 | OS | A 1000 Kbyte memory is managed using variable partitions but to
GATE - 1996 | OS | The correct matching for the following pairs is
GATE - 1996 | OS | Which of the following is an example of spooled device?
GATE - 1996 | OS | A critical section is a program segment
GATE- 1996 | OS | The process state transition diagram in below figure is representative of
GATE - 1997 | OS | Each Process Pi, i= 1…….9 is coded as follows
GATE - 1997 | OS | An operating system contains 3 user processes each requiring 2 units
GATE - 1997 | OS | Dirty bit for a page in a page table
GATE - 1997 | OS | I/O redirection
GATE -1997 | OS | Thrashing
GATE - 1997 | OS | Locality of reference implies that the page reference being made by
GATE - 1998 | OS | If an instruction takes i microseconds and a page fault takes an
GATE - 1998 | OS | Consider n processes sharing the CPU in a round-robin fashion.
GATE - 1998 | OS | The overlay tree for a program is as shown below:
GATE - 1998 | OS | A  computer has six tape drives,  with n  processes competing for
GATE - 1998 | OS | A counting semaphore was initialized to 10. Then 6P (wait) operations
GATE - 1998 | OS | When  the  result  of  a  computation  depends  on  the  speed  of  the 
GATE - 1998 | OS | Which of the following is an example of a spooled device?
GATE - 1998 | OS | A linker reads four modules whose lengths are 200, 800, 600, and
GATE - 1999 | OS | Which of the following actions is/are typically not performed by the
GATE - 1999 | OS | Which of the following is/are advantage of virtual memory?
GATE - 1999 | OS | A  multi-user,  multi-processing  operating  system  cannot  be 
GATE - 1999 | OS | System calls are usually invoked by using
GATE - 1999 | OS | Which of the following disk scheduling strategies is likely to give the
GATE - 1999 | OS | Listed below are some operating system abstractions (in the left
GATE - 2000 | OS | Which of the following is NOT a valid deadlock prevention scheme?
GATE - 2000 | OS | Suppose the time to service a page fault is on the average 10
GATE - 2000 | OS | A graphics card has on board memory of 1MB. Which of the following
GATE - 2000 | OS | Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be
GATE - 2000 | OS | Which of the following need not necessarily be saved on a context
GATE - 2001 | OS | Consider Peterson’s algorithm for mutual exclusion between two
GATE - 2001 | OS | Consider a machine with 64 MB physical memory and a 32-bit virtual
GATE - 2001 | OS | Which of the following does not interrupt a running process?
GATE - 2001 | OS | consider a virtual memory system with a FIFO page replacement policy
GATE - 2001 | OS | Consider a set of n tasks with known runtimes r1, r2, ..., rn to be run on
GATE - 2001 | OS | Which of the following statements is false?
GATE - 2002 | OS | In the index allocation scheme of blocks to a file, the maximum
GATE - 2002 | OS | Which combination of the following features will suffice to characterize
GATE - 2002 | OS | Dynamic linking can cause security concerns because
GATE - 2002 | OS | The optimal page replacement algorithm will select the page that
GATE - 2002 | OS | Which of the following scheduling algorithms is non-preemptive?
GATE - 2003 | OS | Suppose we want to synchronize two concurrent processes
GATE - 2003 | OS | Suppose we want to synchronize two concurrent processes P and Q
GATE - 2003 | OS | A processor uses 2-level page tables for virtual
GATE - 2003 | OS | A processor uses 2-level page tables for virtual to physical address
GATE - 2003 | OS | A uni-processor computer system only has two processes, both of
GATE - 2003 | OS | In a system with 32 bit virtual addresses and 1KB page size, use of
GATE - 2004 | OS | Consider the following schedule S of transactions T1 and T2:
GATE - 2004 | OS | In a virtual memory system, size of virtual address is 32-bit, size of
GATE - 2004 | OS | The semaphore variables full, empty and mutex are initialized to 0, n
GATE - 2004 | OS | A process executes the following segment of code for(i = 1
GATE - 2004 | OS | In a certain operating system, deadlock prevention is attempted
GATE - 2004 | OS | A disk has 200 tracks (numbered 0 through 199). At a given time, it
GATE - 2004 | OS | The storage area of a disk has innermost diameter of 10 cm and
GATE - 2004 | OS | In an enhancement of a design of a CPU, the speed of a floating-point
GATE - 2004 | OS | A CPU has only three instructions I1, I2 and I3, which use the
GATE - 2004 | OS | Consider a fully associative cache with 8 cache blocks (numbered 0-7)
GATE - 2004 | OS | Consider a pipeline processor with 4 stages s1 to s4. we want to
GATE - 2004 | OS | Which one of the following is NOT shared by the threads of the same
GATE - 2004 | OS | What is the bit rate of a video terminal unit with 80 characters/line, 8
GATE - 2004 | OS | A unix-style I-node has 10 direct pointers and one single, one double
GATE - 2004 | OS | Consider two processes P1 and P2 accessing the shared variables X
GATE - 2004 | OS | Consider a system with a two-level paging scheme in which a regular
GATE - 2004 | OS | Consider the following set of processes, with the arrival times and the
GATE - 2004 | OS | The minimum number of page frames that must be allocated to a
GATE - 2004 | OS | Consider an operating system capable of loading and executing a
GATE - 2004 | OS | Consider the following statements with respect to user-level threads
GATE - 2005 | OS | A disk has 8 equidistant tracks.
GATE - 2005 | OS | A disk has 8 equidistant tracks. The diameters of the innermost and
GATE - 2005 | OS | Two shared resources R1 and R2 are used by processes P1 and P2.
GATE - 2005 | OS | Consider a 2-way set associative cache memory with 4 sets and total
GATE - 2005 | OS | We wish to schedule three processes P1, P2 and P3 on a uniprocessor
GATE - 2005 | OS | Two concurrent processes P1 and P2 use four shared resources R1
GATE - 2005 | OS | Given below is a program which when executed spawns two
GATE - 2005 | OS | Increasing the RAM of a computer typically improves performance
GATE - 2005 | OS | Normally user programs are prevented from handling I/O directly by
GATE - 2005 | OS | Consider the following code fragment if (fork() == 0)
GATE - 2006 | OS | The wait and signal operations of a monitor are implemented using
GATE - 2006 | OS | For each of the four processes P1, P2, P3 and P4. The total size in
GATE - 2006 | OS | Consider the solution to the bounded buffer producer/consumer
GATE - 2006 | OS | The arrival time, priority, and duration of the CPU and I/O bursts for
GATE - 2006 | OS | The process state transition diagram of an operating system is as given
GATE - 2006 | OS | In the working-set strategy, which of the following is done by the
GATE - 2006 | OS | A computer system supports 32-bit virtual addresses as well as 32-bit
GATE - 2006 | OS | A CPU generates 32-bit virtual addresses. The page size is 4 KB.
GATE - 2006 | OS | The atomic fetch-and-set x, y instruction unconditionally sets the
GATE - 2006 | OS | Consider three processes (process id 0, 1, 2 respectively) with
GATE - 2006 | OS | Consider three processes, all arriving at time zero, with total
GATE - 2006 | OS | Consider the following snapshot of a system running n processes.
GATE - 2006 | OS | Barrier is a synchronization construct where a set of processes synchronizes
GATE - 2006 | OS | Barrier is a synchronization construct where a set of processes
GATE - 2006 | OS | Consider three CPU-intensive processes, which require 10, 20 and 30
GATE - 2007 | OS | The head of a hard disk serves requests following the SSTF
GATE - 2007 | OS | The head of a hard disk serves requests following the shortest seek
GATE - 2007 | OS | A demand paging system takes 100 time units to service a page fault
GATE - 2007 | OS | Consider n jobs J1, J2,......Jn such that job Ji has execution time
GATE - 2007 | OS | The address sequence generated by tracing a particular program
GATE - 2007 | OS | Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These
GATE - 2007 | OS | Processes P1 and P2 use critical_flag in the following routine to
GATE - 2007 | OS | A process has been allocated 3 page frames. Assume that none of the
GATE - 2007 | OS | Two processes, P1 and P2, need to access a critical section of code.
GATE - 2007 | OS | A single processor system has three resource types X, Y, and Z, which
GATE - 2007 | OS | A virtual memory system uses First In First Out (FIFO) page replacement
GATE - 2007 | OS | An operating system uses Shortest Remaining Time First (SRT)
GATE - 2007 | OS | Consider the following statements about user level threads and kernel
GATE - 2007 | OS | Group 1 contains some CPU scheduling algorithms and Group 2
GATE - 2008 | OS | Match the following flag bits used in the context of virtual memory
GATE - 2008 | OS | If the time-slice used in the round-robin scheduling policy is more than
GATE - 2008 | OS | An operating system implements a policy that requires a process to
GATE - 2008 | OS | The following is a code with two threads, producer and consumer
GATE - 2008 | OS | A processor uses 36 bit physical addresses and 32 bit virtual addresses
GATE - 2008 | OS | A process executes the following code for (i =0; i < n; i + +) for ( )
GATE - 2008 | OS | Which of the following is NOT true of deadlock prevention and deadlock
GATE - 2008 | OS | Which of the following statements about synchronous and asynchronous
GATE - 2008 | OS | The P and V operations on counting semaphores, where s is a counting
GATE - 2008 | OS | The data blocks of a very large file in the Unix file system are allocated using
GATE - 2009 | OS | A multilevel page table is preferred in comparison to a single level page
GATE - 2009 | OS | The enter_CS() and leave_CS() functions to implement critical section of
GATE - 2009 | OS | In the following process state transition diagram for a uniprocessor system
GATE - 2009 | OS | Consider a disk system with 100 cylinders. The requests to access the
GATE - 2009 | OS | The essential content(s) in each entry of a page table is / are
GATE - 2009 | OS | In which one of the following page replacement policies, Belady’s anomaly
GATE - 2010 | OS | A system has n resources R0,...,Rn-1,and k processes P0,....Pk-1.
GATE - 2010 | OS | The following program consists of 3 concurrent processes and 3 binary
GATE - 2010 | OS | A system uses FIFO policy for page replacement. It has 4 page frames with
GATE - 2010 | OS | Consider the methods used by processes P1 and P2 for accessing their critical
GATE - 2010 | OS | Which of the following statements are true? Shortest remaining time first
GATE - 2011 | OS | Consider the following table of arrival time and burst time for three processes
GATE - 2011 | OS | Let the time taken to switch between user and kernel modes of execution be t1
GATE - 2011 | OS | A thread is usually defined as a "light weight process" because an operating
GATE - 2011 | OS | Let the page fault service time to 10 ms in a computer with average memory
GATE - 2012 | OS | Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On
GATE - 2012 | OS | A file system with 300 GByte disk uses a file descriptor with 8 direct
GATE - 2012 | OS | Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads
GATE - 2012 | OS | Consider the 3 processes, P1, P2 and P3 shown in the table.
GATE - 2012 | OS | A process executes the code fork(); fork(); fork(); The total number of child
GATE - 2013 | OS | A computer uses 46-bit virtual address, 32-bit physical address
GATE - 2013 | OS | A certain computation generates two arrays a and b such that a[i]=f(i)
GATE - 2013 | OS | A shared variable x, initialized to zero, is operated on by four concurrent
GATE - 2013 | OS | Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders
GATE - 2013 | OS | Three concurrent processes X, Y, and Z execute three different code segments
GATE - 2013 | OS | A scheduling algorithm assigns priority proportional to the waiting time
GATE - 2014 | OS | The memory access time is 1 nanosecond for a read operation with a hit in
GATE - 2014 | OS | Consider a paging hardware with a TLB. Assume that the entire page table
GATE - 2014 | OS | An operating system uses shortest remaining time first scheduling
GATE - 2014 | OS | Consider the basic block given below. a = b + c c = a + d
GATE - 2014 | OS | A system contains three programs and each requires three tape
GATE - 2014 | OS | A computer has twenty physical page frames which contain pages
GATE - 2014 | OS | Three processes A, B and C each execute a loop of 100 iterations. In each
GATE - 2014 | OS | Consider the procedure below for the Producer-Consumer problem which
GATE - 2014 | OS | A FAT (file allocation table) based file system is being used and the total
GATE - 2014 | OS | Assume that there are 3 page frames which are initially empty. If the page
GATE - 2014 | OS | Consider the following set of processes that need to be scheduled on a single
GATE - 2014 | OS | An operating system uses the Banker’s algorithm for deadlock avoidance
GATE - 2014 | OS | Which one of the following is FALSE? User-level threads are not
GATE - 2014 | OS | Suppose a disk has 201 cylinders, numbered from 0 to 200. At some
GATE - 2015 | OS | For the processes listed in the following table, which of the following
GATE - 2015 | OS | Consider the following policies for preventing deadlock in a system with mutually
GATE - 2015 | OS | The maximum number of processes that can be in Ready state for a computer
GATE - 2015 | OS | A computer system implements 8 kilobyte pages and a 32-bit physical address
GATE - 2015 | OS | A computer system implements a 40-bit virtual address, page size of 8 kilobytes
GATE - 2015 | OS | A system has 6 identical resources and N processes competing for them.
GATE - 2015 | OS | Consider a main memory with five page frames and the following sequence
GATE - 2015 | OS | Suppose the following disk request sequence (track numbers)
GATE - 2015 | OS | Consider a uniprocessor system executing three tasks T1, T2, and T3, each of which is composed of an infinite sequence of jobs (or instances)
GATE - 2015 | OS | The following two functions P1 and P2 that share a variable B with
GATE - 2016 | OS | Consider a non-negative counting semaphore S. The operation P(S)
GATE - 2016 | OS | Consider the following two-process synchronization solution. Process
GATE - 2016 | OS | Consider the following processes, with the arrival time and the length
GATE - 2016 | OS | In which one of the following page replacement algorithms
GATE - 2016 | OS | Consider the following proposed solution for the critical section problem
GATE - 2016 | OS | Consider a computer system with ten physical page frames.
GATE - 2016 | OS | Consider a disk queue with requests for I/O to blocks on cylinders 47
GATE - 2016 | OS | Consider a computer system with 40-bit virtual addressing and a page
GATE - 2016 | OS | Consider an arbitrary set of CPU-bound processes with unequal CPU
GATE - 2017 | OS | Consider the set of processes with arrival time (in milliseconds)
GATE - 2017 | OS | A system shares 9 tape drives. The current allocation and maximum
GATE - 2017 | OS | In a file allocation system, which of the following allocation scheme(s)
GATE - 2017 | OS | Which of the following is/are shared by all the threads in a process?
GATE - 2017 | OS | Recall that Belady’s anomaly is that the page-fault rate may increase
GATE - 2017 | OS | A multithreaded program P executes with x number of threads and used
GATE - 2017 | OS | Consider the following CPU processes with arrival times
GATE - 2017 | OS | Threads of a process share
GATE - 2018 | OS | In a system, there are three types of resources: E, F and G. Four
GATE - 2018 | OS | Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3)
GATE - 2018 | OS | Consider the following solution to the producer-consumer synchronization
GATE - 2018 | OS | Consider a system with 3 processes that share 4 instances of the same
GATE - 2018 | OS | Consider a process executing on an operating system that uses demand paging
GATE - 2020 | OS | Consider a paging system that uses a 1-level page table residing in main
GATE - 2020 | OS | Consider the following five disk access requests of the form
GATE - 2020 | OS | Each of a set of n processes executes the following code using two semaphores
GATE - 2020 | OS | Consider the following set of processes, assumed to have arrived at time 0.
GATE - 2020 | OS | Consider the following statements about process state transitions for a system
GATE - 2020 | Consider allocation of memory to a new process. Assume that
GATE - 2019 | Consider the following snapshot of a system running n concurrent processes. Process i
GATE - 2019 | The index node (inode) of a Unix-like file system has 12 direct, one single-indirect
GATE - 2019 | Consider the following four processes with arrival times (in milliseconds)
GATE - 2019 | Assume that in a certain computer, the virtual addresses are 64 bits long
GATE - 2019 | The following C program is executed on a Unix/Linux system:
GATE - 2019 | Consider three concurrent processes P1, P2 and P3 as shown below
 

 

Computer Science Engineers

B-tech Subjects