GATE 2007
In Banker's Algorithm, if the available resource vector is [3, 3, 2] and a process P1 with allocation [2, 0, 0] completes, what will be the new available resource vector?
A disk pack has 16 surfaces, 128 tracks per surface, and 256 sectors per track. 512 bytes of data are stored in each sector. What …
The Banker's algorithm for deadlock handling is used for:
A Translation Lookaside Buffer (TLB) is an associative hardware cache used specifically to speed up:
Peterson's algorithm is a software solution that guarantees mutual exclusion between:
Which page replacement algorithm achieves the lowest possible page fault rate for a fixed number of frames, but cannot be implemen…
In deadlock handling, the technique of aging is used to resolve:
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.