The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+11 votes

Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.

Process Name |
Arrival Time |
Execution Time |

A | $0$ | $6$ |

B | $3$ | $2$ |

C | $5$ | $4$ |

D | $7$ | $6$ |

E | $10$ | $3$ |

Using the *shortest remaining time first* scheduling algorithm, the average process turnaround time (in msec) is ____________________.

+20 votes

Best answer

+4 votes

**Solution:** Let the processes be A, ,C,D and E. These processes will be executed in following order. Gantt chart is as follows:First 3 sec, A will run, then remaining time A=3, B=2,C=4,D=6,E=3 Now B will get chance to run for 2 sec, then remaining time. A=3, B=0,C=4,D=6,E=3 Now A will get chance to run for 3 sec, then remaining time. A=0, B=0,C=4,D=6,E=3 By doing this way, you will get above gantt chart. Scheduling table:As we know, turn around time is total time between submission of the process and its completion. i.e turn around time=completion time-arrival time. i.e. TAT=CT-AT Turn around time of A = 8 (8-0) Turn around time of B = 2 (5-3) Turn around time of C = 7 (12-5) Turn around time of D = 14 (21-7) Turn around time of E = 5 (15-10) Average turn around time is (8+2+7+14+5)/5 = 7.2. Answer is 7.2.

- All categories
- General Aptitude 1.5k
- Engineering Mathematics 7.1k
- Digital Logic 2.7k
- Programming & DS 4.9k
- Algorithms 4.2k
- Theory of Computation 5.3k
- Compiler Design 2.1k
- Databases 4k
- CO & Architecture 3.5k
- Computer Networks 4k
- Non GATE 1.4k
- Others 1.5k
- Admissions 559
- Exam Queries 553
- Tier 1 Placement Questions 23
- Job Queries 69
- Projects 18

47,913 questions

52,293 answers

182,250 comments

67,739 users