Sunday 7 June 2015

CS604 - Operating Systems Assignment No. 2 Solution Spring 2015 Due Date: June 10, 2015

Assignment No. 02
Semester: Spring 2015
CS604 –Operating System
Total Marks: 15

Due Date: 10/06/2015
Uploading instructions:

  • 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.


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?

No comments:

Post a Comment