Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors

GATE 2004 CPU scheduling PYQ

Photo of author

By Team EasyExamNotes

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? 
(a) 5.50 
(b) 5.75  
(c) 6.00 
(d) 6.25 
Download as PDF

Related posts:

  1. GATE CS 2020 CPU Scheduling PYQ
  2. GATE CPU scheduling PYQ
  3. GATE 1996 CPU Scheduling algo completion time RR
  4. GATE 2006 CPU scheduling PYQ
  5. GATE 2005 CPU scheduling PYQ
  6. GATE CPU scheduling PYQ
  7. GATE 2017 Bankers algorithm Dead lock PYQ
  8. GATE 2014 DEADLOCK BAKERS ALGO PYQ
  9. GATE 2015 DEADLOCK BANKERS ALGO PYQ
  10. GATE Bankers Algorithms
  11. Develop a Gantt Chart, Average Waiting time, FCFS, SJF, RR
  12. OS#08 | Contiguous and linked list allocation for implementing file system in Hindi video | RGPV previous years