GATE 1990
A system has 3 resource types with total instances (10, 5, 7). Current allocation matrix shows allocated totals (7, 2, 5). How many instances of each resource type are currently available?
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:
The C-SCAN (Circular SCAN) disk scheduling algorithm differs from standard SCAN in that C-SCAN:
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:
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.