💻

GATE CS - Operating Systems

Practice process management, memory management, file systems, and disk scheduling

100 questions10 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 3 of 10 • Questions 21-30 of 100
Q21medium

What is the main difference between a process and a thread?

Q22easy

In a system using demand paging, when does a page fault occur?

Q23hard

What is the time complexity of LRU page replacement algorithm implementation using a stack?

Q24medium

Which file allocation method has no external fragmentation?

Q25medium

What is the main advantage of multilevel page tables?

Q26medium

In Round Robin with time quantum = 4ms, if a process has burst time 10ms, how many context switches occur?

Q27easy

What is the purpose of the reference bit in page replacement?

Q28medium

Which scheduling algorithm is used in real-time systems?

Q29medium

What is the main problem with the Producer-Consumer problem?

Q30hard

In a system with 3 frames, using FIFO page replacement with reference string 1,2,3,4,1,2,5,1,2,3,4,5, how many page faults occur?