GATE CSE · Computer Science and Information Technology
Processes, threads, synchronisation, deadlocks; CPU and I/O scheduling; memory management and virtual memory; file systems.
Test yourself on Operating System
5 real GATE CSE questions with instant answers — no signup, ~3 minutes.
Study notes are still being prepared.
Don't wait — Shishya can teach you this topic right now, on demand.
Ask Shishya to teach this →Shishya is your personal tutor for this topic. Pick a starter or open a free chat.
Q1 · Operating System · MEDIUM
A system uses the Least Recently Used (LRU) page replacement algorithm with 3 page frames. Given the page reference string 2, 3, 4, 2, 1, 3, 5, 2, 4, how many page faults occur?
Q2 · Operating System · HARD
Three processes P1, P2, and P3 require resources R1, R2, and R3. The allocation matrix is [[1,0,1], [1,1,0], [0,0,1]] and the maximum need matrix is [[2,1,2], [3,2,1], [1,1,2]]. Available resources are [1,1,0]. Which of the following sequences is a safe sequence?
Q3 · Operating System · EASY
A system has 4 processes P1, P2, P3, P4 with arrival times 0, 1, 2, 3 ms and burst times 8, 4, 2, 1 ms respectively. Using Shortest Job First (SJF) non-preemptive scheduling, what is the average waiting time?
Q4 · Operating System · HARD
A system uses a two-level page table. The logical address space is 2^32 bytes, page size is 4 KB, and each page table entry is 4 bytes. If the outer page table fits in a single page, how many entries are in the inner page table?
Q5 · Operating System · MEDIUM
A system has 3 resource types A, B, C with instances (7, 5, 3). Current allocation matrix is P0:(0,1,0), P1:(2,0,0), P2:(3,0,2), P3:(2,1,1), P4:(0,0,2). Maximum need matrix is P0:(7,5,3), P1:(3,2,2), P2:(9,0,2), P3:(2,2,2), P4:(4,3,3). Is the system in a safe state?