CS604 Assignment No 2 Solution Spring 2019

CS604 Assignment No 2 Spring 2019

Dear Students, Here you can read or Download CS604 - Operating Systems Assignment No 2 Solution of Semester Spring 2019. Assignment Due Date is 03 June, 2019. Total Marks are 20. We are here to facilitate your learning and we do not appreciate the idea of copying or replicating solutions. Assignment Solution File has been added. Previously we shared CS502 Assignment No 2 Solution Spring 2019.

CS604 Assignment No 2 Solution and discussion Spring 2019

CS604 Assignment Objective:

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

Different Process Scheduling Algorithms in Operating System

CS604 Assignment Rules For 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.

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

CS604 Assignment Question No 1:

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

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=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