GATE GATE Operating Systems 1

Question 1

Which page replacement algorithm suffers from Belady's anomaly?

Accepted Answer

FIFO

Answer

FIFO can paradoxically increase page faults when more frames are added, a phenomenon known as Belady's anomaly.

Question 2

In a system with 5 processes and 3 resource types, which algorithm is used to detect deadlock?

Accepted Answer

Cycle detection in allocation graph

Answer

Deadlock detection in multi-instance resource systems uses a cycle-detection algorithm on the resource-allocation graph.

Question 3

Which scheduling algorithm can cause starvation of low-priority processes?

Accepted Answer

Priority Scheduling

Answer

Priority Scheduling can starve low-priority processes indefinitely if high-priority processes keep arriving.

Question 4

What is the main advantage of multilevel feedback queue scheduling?

Accepted Answer

It adapts to process behavior dynamically

Answer

Multilevel feedback queues promote or demote processes based on their CPU burst behavior, adapting dynamically to workload characteristics.

Question 5

In virtual memory, what does the Translation Lookaside Buffer (TLB) store?

Accepted Answer

Page table entries for recently accessed pages

Answer

The TLB is a hardware cache that stores recent virtual-to-physical page table mappings to speed up address translation.

(GATE) Graduate Aptitude Test in Engineering Practice Test