Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

I've got a confusion in the following section of a book. Here we taking about FCFS Scheduling. I feel that calculation table is incorrect in the book. Because P3 got completed at time 7, it's turnaround time should be 7-3 because third process arrival time is 3 so why they take 1? Remember turn around time = t(process completed)-t(process submitted)

For P4 it's 11-4 which I feel wrong again. Further for P5. So I want to know whether I'm wrong in understanding this all or the following is really a wrong calculation. Can someone please explain. Thanks! Check the fallowing links for book scan: http://i.stack.imgur.com/oGtva.jpg http://i.stack.imgur.com/mVP03.jpg

share|improve this question
    
However I gave a quick look at the tables and it seems that you are right: for P3, P4, P5 the table wrongly reports (completion time - processing time) instead of (completion time - arrival time). And as a consequence the waiting times on the rightmost column are also wrong. –  Vor Feb 9 '13 at 11:16
    
@MarzioDeBiasi thanks ! I will remember your suggestion in further posts ! –  user1938918 Feb 9 '13 at 11:26
add comment

migrated from cstheory.stackexchange.com Feb 10 '13 at 6:24

This question came from our site for theoretical computer scientists and researchers in related fields.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.