💻
GATE CS - Operating Systems
Practice process management, memory management, file systems, and disk scheduling
100 questions•10 pages•~150 min
Use this quiz track to strengthen recall, speed, and exam-style decision making. Attempt one page first, review explanations, and then re-attempt incorrect questions without notes.
A good scoring strategy is to mark uncertain questions, finish known ones quickly, and return with elimination logic. This improves accuracy while keeping momentum under time constraints.
Progress: 0 / 1000%
Page 2 of 10 • Questions 11-20 of 100
Q11easy
Which disk scheduling algorithm services requests closest to current head position?
Q12medium
What is the main advantage of indexed file allocation over linked allocation?
Q13medium
In a system with 32-bit logical addresses and 4KB page size, how many bits are used for page offset?
Q14easy
What happens when a page fault occurs?
Q15easy
Which scheduling algorithm is preemptive?
Q16medium
What is the average waiting time for processes P1(24ms), P2(3ms), P3(3ms) using FCFS scheduling?
Q17hard
In a system with 16-bit logical addresses and 1KB page size, how many pages can be addressed?
Q18medium
Which page replacement algorithm suffers from Belady's anomaly?
Q19easy
What is the purpose of TLB (Translation Lookaside Buffer)?
Q20easy
In SCAN disk scheduling, the disk arm:
...