Subject analysis · 2017–2026
Operating Systems (OS)
Every GATE CS question on Operating Systems (OS), with how the marks are spread across years and topics.
Questions
78
6 topics
Avg marks / year
12.6
126 marks over 10 years
Peak year
2024
20 marks
Trend
Rising
+64% last 3 yrs
Marks per year
Both shifts counted where there were two · peak highlighted
avg 12.6
12
8
10
10
13
10
11
20
15
17
'17'18'19'20'21'22'23'24'25'26
Topic share
Share of Operating Systems (OS)'s 126 marks
6
topics
- Memory Management and Virtual Memory29%
- CPU and I/O Scheduling17%
- File Systems Operations & Disk Scheduling Optimization16%
- Concurrency & Synchronization16%
- Deadlock Prevention, Avoidance, Detection, Recovery11%
- System Calls, Processes, Threads, InterProcess Communication11%
Topic × year heatmap
Marks from each topic in each year — darker is heavier. Topics that light up every column are the safest bets.
| '17 | '18 | '19 | '20 | '21 | '22 | '23 | '24 | '25 | '26 | |
|---|---|---|---|---|---|---|---|---|---|---|
| Memory Management and Virtual Memory | 2 | 1 | 2 | 3 | 3 | 4 | 6 | 5 | 7 | 4 |
| CPU and I/O Scheduling | 3 | 2 | 2 | 2 | 2 | 1 | 2 | 4 | 3 | |
| File Systems Operations & Disk Scheduling Optimization | 1 | 2 | 2 | 2 | 1 | 2 | 4 | 2 | 4 | |
| Concurrency & Synchronization | 2 | 2 | 1 | 2 | 4 | 1 | 2 | 4 | 2 | |
| Deadlock Prevention, Avoidance, Detection, Recovery | 2 | 3 | 2 | 2 | 1 | 2 | 2 | |||
| System Calls, Processes, Threads, InterProcess Communication | 2 | 1 | 1 | 1 | 2 | 5 | 2 |
All 78 Operating Systems (OS) questions
2026 10 questions · 17 marks
- FN · Q29With respect to deadlocks in an operating system, which of the following statements is/are FALSE?Deadlock Prevention, Avoidance, Detection, Recovery · MSQ · 1 mark
- FN · Q35Consider a system consisting of k instances of a resource R , being shared by 5 processes. Assume that each process requires a maximum of two instances of reso…Deadlock Prevention, Avoidance, Detection, Recovery · NAT · 1 mark
- FN · Q59Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track is 1 millisecond. Initially,…File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- FN · Q63Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the fork() system call is always successfu…System Calls, Processes, Threads, InterProcess Communication · NAT · 2 marks
- FN · Q64Consider a CPU that has to execute two types of processes. The first type, Actuators (A), requires a CPU burst of 6 seconds. The second type, Controllers (C),…CPU and I/O Scheduling · NAT · 2 marks
- AN · Q23Which one of the following CPU scheduling algorithms cannot be preemptive?CPU and I/O Scheduling · MCQ · 1 mark
- AN · Q51Consider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A and B are two binary semaphores initialized to 1 and 0, res…Concurrency & Synchronization · MSQ · 2 marks
- AN · Q53To keep track of free blocks in a file system, one of the two approaches is generally used – using bitmaps (bit vectors) or using linked lists. Consider that t…File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- AN · Q54A system has a Translation Lookaside Buffer (TLB) that has a reach of 1 MB. TLB reach is defined as the total amount of physical memory that can be accessed th…Memory Management and Virtual Memory · NAT · 2 marks
- AN · Q55Consider contiguous allocation of physical memory to processes using variable partitioning scheme. Suppose there are 8 holes in the memory of sizes 20 KB, 4 KB…Memory Management and Virtual Memory · NAT · 2 marks
2025 9 questions · 15 marks
- FN · Q14Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 bytes. Assuming that the memory i…Memory Management and Virtual Memory · MCQ · 1 mark
- FN · Q29Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an I/O related operation is perf…CPU and I/O Scheduling · NAT · 1 mark
- FN · Q38A computer has two processors, M 1 and M 2 . Four processes P 1, P 2, P 3, P 4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respectively, arrive at the…CPU and I/O Scheduling · MCQ · 2 marks
- FN · Q51A disk of size 512 M bytes is divided into blocks of 64 K bytes. A file is stored in the disk using linked allocation. In linked allocation, each data block re…File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- FN · Q54In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A modification of the optimal pa…Memory Management and Virtual Memory · NAT · 2 marks
- AN · Q26Processes P1 , P2 , P3 , P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 13, 6, and 9 milliseconds r…CPU and I/O Scheduling · MCQ · 1 mark
- AN · Q47Consider a demand paging system with three frames, and the following page reference string: 1 2 3 4 5 4 1 6 4 5 1 3 2. The contents of the frames are as follow…Memory Management and Virtual Memory · MSQ · 2 marks
- AN · Q48P = \ P 1, P 2, P 3, P 4\ consists of all active processes in an operating system. R = \ R 1, R 2, R 3, R 4\ consists of single instances of distinct types of…Deadlock Prevention, Avoidance, Detection, Recovery · MSQ · 2 marks
- AN · Q58A computer system supports a logical address space of 2 32 bytes. It uses two-level hierarchical paging with a page size of 4096 bytes. A logical address is di…Memory Management and Virtual Memory · NAT · 2 marks
2024 12 questions · 20 marks
- FN · Q24Which of the following statements about threads is/are TRUE?System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- FN · Q25Which of the following process state transitions is/are NOT possible?System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- FN · Q40Consider the following two threads T1 and T2 that update two shared variables a and b . Assume that initially a = b = 1 . Though context switching between thre…Concurrency & Synchronization · MCQ · 2 marks
- FN · Q54Consider a 512 GB hard disk with 32 storage surfaces. There are 4096 sectors per track and each sector holds 1024 bytes of data. The number of cylinders in the…File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- FN · Q57Consider the following code snippet using the fork() and wait() system calls. Assume that the code compiles and runs correctly, and that the system calls run s…System Calls, Processes, Threads, InterProcess Communication · NAT · 2 marks
- FN · Q62Consider a memory management system that uses a page size of 2 KB. Assume that both the physical and virtual addresses start from 0. Assume that the pages 0, 1…Memory Management and Virtual Memory · NAT · 2 marks
- AN · Q24Which of the following tasks is/are the responsibility/responsibilities of the memory management unit (MMU) in a system with paging-based memory management?Memory Management and Virtual Memory · MSQ · 1 mark
- AN · Q25Consider a process P running on a CPU. Which one or more of the following events will always trigger a context switch by the OS that results in process P movin…System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- AN · Q37Consider a single processor system with four processes A, B, C, and D, represented as given below, where for each process the first value is its arrival time,…CPU and I/O Scheduling · MCQ · 2 marks
- AN · Q46Consider a multi-threaded program with two threads T1 and T2. The threads share two semaphores: s1 (initialized to 1) and s2 (initialized to 0). The threads al…Concurrency & Synchronization · MSQ · 2 marks
- AN · Q53Consider a disk with the following specifications: rotation speed of 6000 RPM, average seek time of 5 milliseconds, 500 sectors/track, 512 byte sectors. A file…File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- AN · Q64Consider a 32-bit system with 4 KB page size and page table entries of size 4 bytes each. Assume 1 KB = 2 10 bytes. The OS uses a 2-level page table for memory…Memory Management and Virtual Memory · NAT · 2 marks
2023 7 questions · 11 marks
- FN · Q22Which one or more of the following need to be saved on a context switch from one thread (T1) of a process to another thread (T2) of the same process?System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- FN · Q23Which one or more of the following options guarantee that a computer system will transition from user mode to Kernel mode?System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- FN · Q27Which one or more of the following CPU scheduling algorithms can potentially cause starvation?CPU and I/O Scheduling · MSQ · 1 mark
- FN · Q38Consider the two functions incr and decr shown below: c incr( ) wait(s); X = X + 1; signal(s); decr( ) wait(s); X = X - 1; signal(s); There are 5 threads each…Concurrency & Synchronization · MCQ · 2 marks
- FN · Q42A 4 kilobyte (KB) byte-addressable memory is realized using four 1 KB memory blocks. Two input address lines (IA4 and IA3) are connected to the chip select (CS…Memory Management and Virtual Memory · MCQ · 2 marks
- FN · Q57Consider the following two-dimensional array D in the C programming language, which is stored in row-major order: c int D[128][128]; Demand paging is used for…Memory Management and Virtual Memory · NAT · 2 marks
- FN · Q58Consider a computer system with 57-bit virtual addressing using multi-level tree-structured page tables with L levels for virtual to physical address translati…Memory Management and Virtual Memory · NAT · 2 marks
2022 6 questions · 10 marks
- FN · Q19Consider the following threads, T 1, T 2 and T 3 executing on a single processor, synchronized using three binary semaphore variables, S 1, S 2 and S 3, operat…Concurrency & Synchronization · MCQ · 1 mark
- FN · Q26Which of the following statements is/are TRUE with respect to deadlocks?Deadlock Prevention, Avoidance, Detection, Recovery · MSQ · 1 mark
- FN · Q38Which one of the following statements is FALSE?Memory Management and Virtual Memory · MCQ · 2 marks
- FN · Q42Consider four processes P, Q, R, and S scheduled on a CPU as per round robin algorithm with a time quantum of 4 units. The processes arrive in the order P, Q,…CPU and I/O Scheduling · MCQ · 2 marks
- FN · Q63Consider two files systems A and B, that use contiguous allocation and linked allocation, respectively. A file of size 100 blocks is already stored in A and al…File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
- FN · Q64Consider a demand paging system with four page frames (initially empty) and LRU page replacement policy. For the following page reference string 7, 2, 7, 3, 2,…Memory Management and Virtual Memory · NAT · 2 marks
2021 9 questions · 13 marks
- FN · Q21In the context of operating systems, which of the following statements is/are correct with respect to paging?Memory Management and Virtual Memory · MSQ · 1 mark
- FN · Q24Which of the following standard C library functions will always invoke a system call when executed from a single-threaded process in a UNIX/Linux operating sys…System Calls, Processes, Threads, InterProcess Communication · MSQ · 1 mark
- FN · Q25Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with th…File Systems Operations & Disk Scheduling Optimization · MSQ · 1 mark
- FN · Q35Three processes arrive at time zero with CPU bursts of 16, 20 and 10 milliseconds. If the scheduler has prior knowledge about the length of the CPU bursts, the…CPU and I/O Scheduling · NAT · 1 mark
- FN · Q56Consider the following pseudocode, where S is a semaphore initialized to 5 in line 2 and counter is a shared variable initialized to 0 in line 1. Assume that t…Concurrency & Synchronization · MSQ · 2 marks
- AN · Q24Which of the following statement(s) is/are correct in the context of CPU scheduling?CPU and I/O Scheduling · MSQ · 1 mark
- AN · Q52Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes P 1 and P 2, and each of the processes spawns two…Concurrency & Synchronization · MSQ · 2 marks
- AN · Q53Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time.…Deadlock Prevention, Avoidance, Detection, Recovery · MSQ · 2 marks
- AN · Q58Consider a three-level page table to translate a 39-bit virtual address to a physical address as shown below: The page size is 4 KB (1 KB = 2 10 bytes) and pag…Memory Management and Virtual Memory · NAT · 2 marks
2020 6 questions · 10 marks
- FN · Q21Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process's memory requirement. Hence,…Memory Management and Virtual Memory · MCQ · 1 mark
- FN · Q22Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A…System Calls, Processes, Threads, InterProcess Communication · MCQ · 1 mark
- FN · Q44Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared varia…Concurrency & Synchronization · MCQ · 2 marks
- FN · Q45Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. (P, 15…File Systems Operations & Disk Scheduling Optimization · MCQ · 2 marks
- FN · Q60Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR…CPU and I/O Scheduling · NAT · 2 marks
- FN · Q63Consider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns and TLB l…Memory Management and Virtual Memory · NAT · 2 marks
2019 6 questions · 10 marks
- FN · Q27Consider the following C program is executed on a Unix/Linux system: c include<unistd.h> int main( ) int i; for (i = 0; i < 10; i++) if (i % 2 == 0) fork( ); r…System Calls, Processes, Threads, InterProcess Communication · NAT · 1 mark
- FN · Q33Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100. The processes are executed…Concurrency & Synchronization · NAT · 1 mark
- FN · Q43Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page…Memory Management and Virtual Memory · MCQ · 2 marks
- FN · Q49Consider the following snapshot of a system running n concurrent processes. Process i is holding X i instances of a resource R, 1 i n . Assume that all instanc…Deadlock Prevention, Avoidance, Detection, Recovery · MCQ · 2 marks
- FN · Q51Consider the following four processes with arrival times (in milliseconds) and their length of CPU burst (in milliseconds) as shown below: These processes are…CPU and I/O Scheduling · NAT · 2 marks
- FN · Q52The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB and the disk…File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
2018 5 questions · 8 marks
- FN · Q20Consider 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…Memory Management and Virtual Memory · MCQ · 1 mark
- FN · Q34Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can…Deadlock Prevention, Avoidance, Detection, Recovery · NAT · 1 mark
- FN · Q49In a system, there are three types of resources: E, F and G. Four processes P 0, P 1, P 2 and P 3 execute concurrently. At the outset, the processes have decla…Deadlock Prevention, Avoidance, Detection, Recovery · MCQ · 2 marks
- FN · Q50Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is N. Three semaphores empty, full and mutex are defin…Concurrency & Synchronization · MCQ · 2 marks
- FN · Q63Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, … , 199), and 256 sectors per track (numbered as 0, 1, ……File Systems Operations & Disk Scheduling Optimization · NAT · 2 marks
2017 8 questions · 12 marks
- FN · Q18Threads of a process shareSystem Calls, Processes, Threads, InterProcess Communication · MCQ · 1 mark
- FN · Q24Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: If the pre-emptive shortes…CPU and I/O Scheduling · NAT · 1 mark
- FN · Q27A multithreaded program P executes with x number of threads and uses y number of locks for ensuring mutual exclusion while operating on shared memory locations…Concurrency & Synchronization · MCQ · 2 marks
- FN · Q40Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1:…Memory Management and Virtual Memory · MCQ · 2 marks
- AN · Q7Which of the following is/are shared by all the threads in a process? I. Program counter II. Stack III. Address space IV. RegistersSystem Calls, Processes, Threads, InterProcess Communication · MCQ · 1 mark
- AN · Q8In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? I. Contiguous II. Linked III. Ind…File Systems Operations & Disk Scheduling Optimization · MCQ · 1 mark
- AN · Q33A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Which of the following best d…Deadlock Prevention, Avoidance, Detection, Recovery · MCQ · 2 marks
- AN · Q51Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None…CPU and I/O Scheduling · NAT · 2 marks

