We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

# CS604 - Operating Systems.Assignment # 2 has been uploaded, and its due date is 10th June 2015.Total Marks: 15

 Dear Student,In second assignment all of you are required to embed the audio on each slide too, to explain the steps how you calculate them.Regards Assignment No. 02 Semester: Spring 2015

• Your assignment must be in .ppt format. You have to make the power point slides and show the step by step procedure of calculations on slides (Any other formats like scan images, PDF, Zip, rar, bmp, etc will not be accepted).
• Save your assignment with your ID (e.g. bc020200786.doc).
• No assignment will be accepted through email.

Rules for Marking:

It should be clear that your assignment will not get any credit if:

• The assignment is submitted after due date.
• The submitted assignment does not open or file is corrupted.
• Your assignment is copied from internet, handouts or from any other student

(Strict disciplinary action will be taken in this case).

Assignment

Suppose following processes arrive for execution in the sequence given in the table below, and will run the listed amount of time. Answer the given questions by keeping in mind the non-preemptive scheduling technique.

 Process Arrival Time Burst Time P1 0 5 P2 2.0 4.0 P3 4.0 3.0 P4 6.0 6.0

Question:   (5 marks each )

1. A.   Calculate waiting and average turnaround time for these processes with the FCFS scheduling algorithm?

1. B.   Calculate waiting and average turnaround time for these processes with the SJF scheduling algorithm?

1. C.   Calculate waiting and average turnaround time for these processes with the Shortest Remaining time First (SRTF) scheduling algorithm?

NOTE: Do not put any query on MDB about this assignment, if you have any query then email at cs604@vu.edu.pk.

Deadline: Your assignment must be uploaded/submitted on or before 10 June 2015.

Dear Student,

In second assignment all of you are required to embed the audio on each slide too, to explain the steps how you calculate them.

Regards

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

Views: 18378

Attachments:

### Replies to This Discussion

Dear check this video For NON Preemptive Shortest Job First

http://playit.pk/watch?v=LNsHRY5Nk5U

For FCFS scheduling algorithm

http://playit.pk/watch?v=KtuQpQwlmYM

same procedure for question 1

thanks khushi

Question no 1 idea solution in  lecture no 14

and

Question no 2,3 from lecture 15

Best of luck

... DONE ...

devil bahi agr apny kar li hai tu apna solution hi share kar dain

sis u can do it u take lec 14 and 15

non preemitive SRTF ka link share karain koi plz

welcom dua sis

A. Calculate waiting and average turnaround time for these processes with the FCFS scheduling algorithm?
waiting time p1=0 , p2=5, p3=9,p4=12 and the total amount is 18
average waiting is 6.5 or 7
is it true or false plz answer me..........

total amount is 26

## Latest Activity

Mani Siddiqui BS VIII is now friends with Gulfam Mehdi and Bakhtawar khan
35 minutes ago
Mani Siddiqui BS VIII liked + عاتکہ's profile
37 minutes ago
Alishbaa updated their profile
41 minutes ago
Ellen Shades posted blog posts
53 minutes ago
1 hour ago
+Anastasiya and iqra faiz joined Virtual University of Pakistan
1 hour ago
2 hours ago
2 hours ago

1

2

3