💻
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 5 of 10 • Questions 41-50 of 100
Q41medium
Which scheduling algorithm minimizes average waiting time?
Q42medium
What is the main disadvantage of linked file allocation?
Q43hard
In a system with 4 processes where each can request maximum 3 resources, what is the minimum total resources needed to prevent deadlock?
Q44medium
What is the main advantage of C-SCAN over SCAN disk scheduling?
Q45easy
What information is stored in a Process Control Block (PCB)?
Q46medium
In a paging system with page size 4KB, what is the page number for logical address 24576?
Q47medium
What is the main problem with the dining philosophers problem?
Q48medium
Which page replacement algorithm is most commonly used in practice?
Q49medium
What is the purpose of the working set model?
Q50easy
In a system using bit vector for free space management with 1000 blocks, how many bits are needed?
......