#include <unistd.h>
int main() {
int i;
for (i = 0; i < 10; i++) {
if (i % 2 == 0) fork();
}
return 0;
}Assume virtual addresses are 64 bits and physical addresses are 48 bits. The memory is word addressable. The page size is 8 kB and…
Consider a system of n processes where process i holds Xi instances of resource R (all instances in use). Process i can request at…
Consider four processes P1 (AT=0, BT=3), P2 (AT=1, BT=1), P3 (AT=3, BT=3), P4 (AT=4, BT=Z) scheduled using preemptive Shortest Rem…
The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointer. The disk blo…
Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D initialized to 100. P1: D = D +…
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.