Programme Code : BCA
Course Code : CS63
| More

Year : 2012 Views: 726 Submitted By : Nancy Jain On 11th February, 2012

Do you have solution for this Question. If yes    Send Email when get solution.

Q.


1) Consider the following set of processes that arrive in the ready queue at the same time:



Process CPU time

P1 2

P2 5

P3 2

P4 1

P5 4



Consider the following scheduling algorithms:



First Come First Serve (FCFS), Shortest job first (SJF) and Round Robin (quantum = 1)

• What is the turnaround time of each process for each of the above scheduling algorithms?

• What is the waiting time of each process for each of the above scheduling algorithms? 


No Answer Found

All form fields are required.

Name
Email
In above form fill your Name and Email Id. We will send an email when we solve it.