We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

CS604 Operating Systems Assignment No 02 Spring 2019 Solution & Discussion


+ Click Here To Join also Our facebook study Group.


+ Prohibited Content On Site + Report a violation + Report an Issue


..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 2323

.

+ http://bit.ly/vucodes (Vu Study Groups By Subject Codes Wise)

Replies to This Discussion

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

 

“How to Join Subject Study Groups & Get Helping Material”

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

 

Share below link with friends for solution & Discussion. A Single link for help in your education.

http://bit.ly/vucodes

Kindly share solution

Question No 01                                                                       10 marks

Assume you have to apply First Come First Serve (FCFS) scheduling algorithms on the set of different processes given in the table below. The CPU burst time is also given for each process. Consider that all the processes arrive in the ready queue within time 0 seconds. You are required to show the Gantt chart to illustrate the execution sequence of these processes and calculate the total waiting time and average waiting time for the given processes by using FCFS algorithm.

 

 

Process

CPU Burst Time (seconds)

P0

26

P1

11

P2

16

P3

10

P4

34

P5

6

Question No 02                                                                       10 marks

Consider a scenario whereyou have to apply Round Robin scheduling algorithm on the below given set of processeswith each having a quantum size=10 milliseconds. The CPU burst time and arrival time for each process is also provided in the given table.You are required to show the Gantt chart to illustrate the execution sequence of these processes. Moreover, calculate the average turnaround time and average waiting time for given processes by using round robin algorithm.

 

Process

CPU Burst Time (Milliseconds)

Arrival Time

(Milliseconds)

P0

15

0

P1

8

4

P2

25

6

P3

18

9

Idea Solution

Attachments:

correct Q2 TAT will be 14 and waiting time will be 6 for P1

Q1 average Waiting time = 46

Last date 03-june

(Question File)

Spring%202019_CS604_2.docx

Need Solution...

CS604 assignment 2 solution

Attachments:

Bro, ya tw question file ha.... ! Naa k Solution File...

plz cs604 soultion assignmnet no.2

muhaamadaftab30@gmail.com

Sir assignment solution send kr din plz

alijanjwa0305@gmail.com

cs604 q2 idea

Attachments:

correct solution of cs604

Attachments:

RSS

Study Corner For DigiSkills Students

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service