GATE 1990
The C-SCAN (Circular SCAN) disk scheduling algorithm differs from standard SCAN in that C-SCAN:
Which scheduling algorithm assigns CPU to processes in strict order of arrival without preemption?
Which memory management concept loads a page into physical memory only when it is actually referenced during execution?
Peterson's algorithm is a software-based solution that solves the critical section problem for:
In operating systems, a thread shares which of the following resources with other peer threads belonging to the same process?
A critical section is a program segment where:
In Unix, a zombie process is a process that has:
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.