GATE Operating Systems Flashcards
6 cards from real GATE practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 6 GATE Operating Systems flashcards as text
Which page replacement algorithm suffers from Belady's anomaly?
Answer: FIFO
FIFO can paradoxically increase page faults when more frames are added, a phenomenon known as Belady's anomaly.
In a system with 5 processes and 3 resource types, which algorithm is used to detect deadlock?
Answer: Cycle detection in allocation graph
Deadlock detection in multi-instance resource systems uses a cycle-detection algorithm on the resource-allocation graph.
Which scheduling algorithm can cause starvation of low-priority processes?
Answer: Priority Scheduling
Priority Scheduling can starve low-priority processes indefinitely if high-priority processes keep arriving.
What is the main advantage of multilevel feedback queue scheduling?
Answer: It adapts to process behavior dynamically
Multilevel feedback queues promote or demote processes based on their CPU burst behavior, adapting dynamically to workload characteristics.
In virtual memory, what does the Translation Lookaside Buffer (TLB) store?
Answer: Page table entries for recently accessed pages
The TLB is a hardware cache that stores recent virtual-to-physical page table mappings to speed up address translation.
Which of the following is NOT a condition for deadlock?
Answer: Preemption
Preemption (allowing resources to be forcibly taken) prevents deadlock; the four necessary conditions are mutual exclusion, hold-and-wait, no preemption, and circular wait.