CS604 Assignment No 2 Solution Fall 2019

CS604 Assignment No 2 Fall 2019

Dear Students, Here you can read or download CS604 - Operating Systems Assignment No 2 Solution of Fall 2019. The Assignment Due Date is 02 December 2019. Total Marks are 20. CS604 Assignment Solution File + Sample Preview and Solution Video Explanation will be added Soon. Previously we shared CS101 Assignment No 2 Solution Fall 2019
\

CS604 Assignment No 2 Solution and Discussion Fall 2019

CS604 Assignment Objective:

The objective of this assignment is to provide hands on experience of:

Different Process Scheduling Algorithms in Operating System

Recommended: How to Solve MCQs Fast

CS604 Assignment Rules of Marking

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

The assignment is submitted after the due date.

The submitted assignment file does not open or it is corrupt.

The submitted assignment solution is copied from any other student or from the internet.

You should consult the recommended books to clarify your concepts as handouts are not sufficient.

You are supposed to : submit your assignment in .doc or docx format.

Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.

Please Note:

We are here to facilitate your learning and we do not appreciate the idea of copying or replicating solutions.

CS604 Assignment Question No. 1

Assume you have to apply Shortest Job First (SJF) 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 except P2 that arrive in ready queue within time 8 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 SJF algorithm.

Process	CPU Burst Time (seconds)
P0	2
P1	6
P2	1
P3	4
P4	3
P5	8

CS604 Assignment Question No. 2

Consider a scenario where you have to apply Round Robin scheduling algorithm on the below given set of processes with each having a quantum size=8 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	18
P3	18	5