Category: OS

GATE 2004 CPU scheduling PYQ

GATE 2004 Consider the following set of processes, vvith the  arrival times and the CPU-burst times given in  milliseconds  Process Arrival Time Burst Time P1 0 5 P2 1 3 P3 2 3 P4 4 1 What is the average turnaround time for these  processes vvith the preemptive Shortest  Remaining Processing Time first (SRPT)  algorithm?  […]

GATE Bankers Algorithms

GATE CS 2014 An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated […]