Skip to content

GATE CS Operating System questions

Practise Operating System questions for GATE CS. Explore official PYQs and original subject-wise quizzes, check answers and view available solutions. Free, no sign-in.

Trace the state changes explicitly. For scheduling, memory and synchronisation questions, record the given policy before calculating the result.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

18 on this page
Official PYQ1995Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
The address sequence generated by tracing a particular program executing in a pure demand based paging system with 100100 records per page with 11 free main memory frame is recorded as follows. What is the number of page faults? 0100,0200,0430,0499,0510,0530,0560,0120,0220,0240,0260,0320,03700100, 0200, 0430, 0499, 0510, 0530, 0560, 0120, 0220, 0240, 0260, 0320, 0370
Official PYQ1995Operating SystemCPU SchedulingMCQ · 1 mark
The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time. …
Official PYQ1995Operating SystemCPU SchedulingMCQ · 1 mark
Which scheduling policy is most suitable for a time shared operating system?
Official PYQ1995Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
Which of the following page replacement algorithms suffers from Belady’s anamoly?
Official PYQ1995Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
In a paged segmented scheme of memory management, the segment table itself must have a page table because
Official PYQ1994Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
Consider the following heap (figure) in which blank regions are not in use and hatched region are in use. The sequence of requests for blocks of sizes 300,25,125,50300, 25, 125, 50 can be satisfied if we use
Official PYQ1994Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
Which one of the following statements is true?
Official PYQ1994Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
A memory page containing a heavily used variable that was initialized very early and is in constant use is removed then
Official PYQ1993Operating SystemCPU SchedulingMCQ · 1 mark
Assume that the following jobs are to be executed on a single processor systemJob IdCPU Burst Timep4q1r8s1t2\begin{array}{|c|c|} \hline \textbf{Job Id} & \textbf{CPU Burst Time} \\ \hline \text{p} & 4 \\ \hline \text{q} & 1 \\ \hline \text{r} & 8 \\ \hline \text{s} & 1 \\ \hline \text{t} & 2 \\ \hline \end{array}The jobs are assumed to have arrived at time …
Official PYQ1993Operating SystemDeadlockMSQ · 1 mark
Consider a system having mm resources of the same type. These resources are shared by 33 processes A,BA, B, and CC which have peak demands of 3,43, 4, and 66 respectively. For what value of mm deadlock will not occur?
Official PYQ1993Operating SystemI/O SchedulingMCQ · 1 mark
The root directory of a disk should be placed
Official PYQ1993Operating SystemSystem CallsNAT · 1 mark
The details of an interrupt cycle are shown in figure. Given that an interrupt input arrives every 11 msec, what is the percentage of the total time that the CPU devotes for the main program execution.
Official PYQ1992Operating SystemMemory Management and Virtual MemoryMCQ · 1 mark
Which of the following is an example of a spooled device?
Official PYQ1992Operating SystemDeadlockMCQ · 1 mark
A computer system has 66 tape devices, with n processes competing for them. Each process may need 33 tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is:
Official PYQ1992Operating SystemConcurrency and SynchronizationMCQ · 1 mark
At a particular time of computation, the value of a counting semaphore is 77. Then 2020 PP operations and 1515 VV operations were completed on this semaphore. The resulting value of the semaphore is :
Official PYQ1991Operating SystemMemory Management and Virtual MemoryMSQ · 1 mark
Indicate all the false statements from the statements given below:
Official PYQ1990Operating SystemMemory Management and Virtual MemoryNAT · 1 mark
In a two-level virtual memory, the memory access time for main memory, tM=10−8t_{M}=10^{-8} sec, and the memory access time for the secondary memory, tD=10−3t_D=10^{-3} sec. What must be the hit ratio, HH such that the access efficiency is within 8080 percent of its maximum value?
Official PYQ1987Operating SystemConcurrency and SynchronizationMCQ · 1 mark
A critical region is