P = {P1,P2,P3,P4} consists of all active processes in an operating system. R = {R1,R2,R3,R4} consists of single instances of distinct types of resources in the system. The resource allocation graph has the following assignment and claim edges. Assignment edges:
Which of the following statement(s) is/are CORRECT?
Consider a demand paging memory management system with 32-bit logical address, 20-bit physical address, and page size of 2048 byte…
Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into I/O queue whenever an …
A computer has two processors, M1 and M2. Four processes P1, P2, P3, P4 with CPU bursts of 20, 16, 25, and 10 milliseconds, respec…
A disk of size 512M bytes is divided into blocks of 64K bytes. A file is stored in the disk using linked allocation. In linked all…
In optimal page replacement algorithm, information about all future page references is available to the operating system (OS). A m…
Processes P1, P2, P3, P4 arrive in that order at times 0, 1, 2, and 8 milliseconds respectively, and have execution times of 10, 1…
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.