Scribd
Upload
36 views1 page

MCA Semester-II Assignment Questions

Five processes P1-P5 are given with their arrival times, CPU burst times in milliseconds, and priorities. The scheduling algorithms First Come First Serve (FCFS), Shortest Job First (SJF), non-preemptive priority based, and Round Robin with a 2ms time slice must be used to calculate the average waiting time and turnaround time of the processes for each algorithm. The algorithm that results in the minimum average waiting time should also be determined.

Uploaded by

BHAVPRITA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
36 views1 page

MCA Semester-II Assignment Questions

Five processes P1-P5 are given with their arrival times, CPU burst times in milliseconds, and priorities. The scheduling algorithms First Come First Serve (FCFS), Shortest Job First (SJF), non-preemptive priority based, and Round Robin with a 2ms time slice must be used to calculate the average waiting time and turnaround time of the processes for each algorithm. The algorithm that results in the minimum average waiting time should also be determined.

Uploaded by

BHAVPRITA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

MCA Semester –II (2019-2022)

Assignment questions

Consider five processes P1,P2,P3,P4 and P5 with their arrival times,


required CPU burst (ms), and priorities as shown in the following table.

Process P1 P2 P3 P4 P5
Arrival time 0 1 4 4 5
CPU Burst(ms) 10 6 4 2 5
Priority 4 4 1 2 4

Assume that the priority number means the higher priority. Compute the
average waiting time and average turnaround time of processes for each
of the following scheduling algorithms. Also determine which of the
following scheduling algorithms result in minimum waiting time.
a. FCFS
b. SJF
c. Non-preemptive priority based
d. Round Robin(if CPU time slice is 2 ms)

You might also like