A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (th…
In a Unix-like operating system, which of the following information is NOT stored inside an inode of a file?
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (th…
Three concurrent processes X,Y,Z execute three different code segments that access and update certain shared variables. Process X …
A shared variable x, initialized to zero, is operated on by four concurrent processes W,X,Y,Z as follows. Each of W and X reads x …
A certain computation generates two arrays a and b such that a[i]=f(i) for 0?i<n and b[i]=g(a[i]) for 0?i<n. It is decomposed into…
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.