GATE 2007
Which of the following graph-theoretic properties characterizes a deadlock condition in a resource allocation graph with multiple instances of each resource type?
Related Operating Systems PYQs
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
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.