GATE CSE: Operating systems

Question 1 of 10

Three processes arrive at time 0 with bursts 24, 3 and 3 (in that order). The average waiting time under FCFS is:

Question 2 of 10

The same three processes (bursts 24, 3, 3) under non-preemptive SJF have an average waiting time of:

Question 3 of 10

With 32-bit virtual addresses and 4 KB pages, how many bits are the page offset?

Question 4 of 10

The reference string 1,2,3,4,1,2,5,1,2,3,4,5 with 3 frames and FIFO replacement causes how many page faults?

Question 5 of 10

Belady's anomaly (more frames, more faults) can occur with:

Question 6 of 10

The Banker's algorithm is used for:

Question 7 of 10

A counting semaphore starts at 10. Then 6 wait (P) and 4 signal (V) operations run. Its final value is:

Question 8 of 10

TLB hit ratio 80%, TLB lookup 20 ns, memory access 100 ns, single-level page table. The effective access time is:

Question 9 of 10

Round robin with a very large time quantum behaves like:

Question 10 of 10

Paging suffers from: