Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. W…
A computer system with 40-bit virtual addressing and page size of 16 KB uses a one-level page table where each page table entry re…
Disk queue requests: 47, 38, 121, 191, 87, 11, 92, 10. Scheduling algorithm: C-LOOK. Head initially at cylinder 63, moving towards…
Consider the proposed critical section algorithm using token array t[i] and c[i] with selection `while (t[j] != 0 && t[j] <= t[i])…
In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number …
Preemptive SRTF scheduling: P1(AT=0, BT=10), P2(AT=3, BT=6), P3(AT=7, BT=1), P4(AT=8, BT=3). The average turnaround time is ______…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.