GATE CS 2018 – Question 20
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is \(M\) units if the corresponding…
Subject-wise GATE questions
Operating Systems
11 questions and papers
GATE CS 2017 Set 2 – Question 51
Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below:ProcessArrival timeBurst timeP107P233P355P462If the pre-emptive shortest remaining time first…
GATE CS 2016 Set 1 – Question 49
Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page…
GATE CS 2014 Set 2 – Question 40
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and…
GATE CS 2014 Set 1 – Question 32
A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page…
GATE CS 2013 – Question 44
A shared variable \(x\), initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads…
GATE CS 2012 – Question 28
A process executes the codefork(); fork(); fork();The total number of child processes created is
GATE CS 2011 – Question 15
A thread is usually defined as a "light weight process" because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation…
GATE CS 2006 – Question 62
Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if…
GATE CS 2010 – Question 42
A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in…
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.