GATE 1996 CPU Scheduling algo completion time RR
GATE 1996 Four jobs to be executed on a single processor system arrive at time 0+ in the order A, B, C, D. Their burst … Read more
GATE 1996 Four jobs to be executed on a single processor system arrive at time 0+ in the order A, B, C, D. Their burst … Read more
GATE 2014 A system contains three programs and each requires three tape units for its operation. The minimum number of tape units Which the system … Read more
GATE 2015 A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the … Read more
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 more
GATE 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 more
GATE 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 more
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 … Read more
GATE 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 more
GATE 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 more
GATE 1998 State an undesirable characteristic of each of the following criteria for measuring performance of an operating system: (a) Turn around time (b) Waitingtime