Consider the following statements about process state transitions for a system using preemptive scheduling: I. A running process c…
Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume…
Consider the following five disk access requests of the form (request id, cylinder number) present in the disk scheduler queue at …
Consider processes P1 (BT=8), P2 (BT=7), P3 (BT=2), P4 (BT=4) arriving at time 0. If time quantum for Round Robin is 4 ms, the abs…
A paging system has 1-level page table, memory access 100 ns, TLB access 20 ns, page fault service 5000 ns. TLB hit ratio 95%, pag…
With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
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.