💻

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 4 of 10 • Questions 31-40 of 100
Q31easy

What is the difference between binary semaphore and counting semaphore?

Q32medium

Which disk scheduling algorithm provides uniform waiting time?

Q33easy

What happens during a context switch?

Q34medium

In a system using segmentation, what information is stored in the segment table?

Q35easy

What is the main advantage of using virtual memory?

Q36medium

Which condition must be broken to prevent deadlock?

Q37hard

What is the effective access time with TLB hit ratio 80%, TLB access time 1ns, memory access time 100ns?

Q38easy

What is the main difference between preemptive and non-preemptive scheduling?

Q39easy

In a directory structure, what is an absolute path?

Q40medium

What is the purpose of the dirty bit (modify bit) in page tables?

......

Quiz Pages

Navigate directly to paginated quiz sets. These links help you revise by page and make every page discoverable.