GATE 2017 Bankers algorithm Dead lock PYQ
GATE 2017 A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Process Current ...
Read moreGATE 2017 A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: Process Current ...
Read moreGATE 2006 The arrival time, priority, and durations of the CPU and I/O bursts for each of three processes P1, P2 and P3 are given ...
Read moreGATE 2005 We wish to schedule three processes P1, P2 and P3 on a uniprocessor system. The priorities, CPU time requirements and arrival times of ...
Read moreGATE 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 ...
Read moreGATE PYQ Q. The sequence …….. is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for…….. unit(s) of time. ...
Read moreGATE 2020 Q50. Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) ...
Read moreGATE 1998 State an undesirable characteristic of each of the following criteria for measuring performance of an operating system: (a) Turn around time (b) Waitingtime
Read moreGATE 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 ...
Read moreWhy is operating system a mandatory software? There are different hardwares. Many more hardwares are about to come. Its not possible for each hardware to ...
Read moreWhy Java not having same name variables ?Ans. As a computer faculty, I found following reason during practise; Consider this example: class EEN { public ...
Read more