- Back to Home »
- CS604 Operating System Assignmrnt no 4 Fall 2012 full Solution
Posted by : Anonymous
Thursday, 27 December 2012
Assignment No. 04
SEMESTER Fall 2012
CS604- Operating System
Total Marks: 20
Due Date:
Thursday,
January 03, 2013
Instructions
Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit if:
o The assignment is submitted after due date.
o The submitted assignment does not open or file corrupt.
o The assignment is copied.
o There is not mentioned the student Id in the assignment File or
name of file is other than student ID.
GOOD LUCK
Marks: 20
Question 1: [Marks 20]
Let us consider a table given below.
Process Arrival Time Burst Time
--------------------------------------------------------------
A 1.0 9
B 1.4 5
C 2.0 2
Above table shows different processes arriving in the sequence listed in the table.
a) Let us consider that CPU remains idle for first 2 unit of time. Draw the Gantt chart and calculate the
average turnaround time for above processes in thissituation by using non preemptive Shortest Job
First (SJF)scheduling strategy. [Marks 3]
b) Let us consider that CPU remains idle for first 1.5unit of time. Draw the Gantt chart and calculate the
average waiting time for above processes in this situation by using non preemptive Shortest Job First
(SJF)scheduling strategy. [Marks 5]
c) Let us consider that CPU remains idle for first 1 unit of time and let us consider that a fourth process ‘D’
enters the system at time 3 and needs 1 unit of CPUtime. Draw the Gantt chart and Calculate the average
waiting time for four processes A, B, C and D in this situation by using preemptive SJFi.e. Shortest
Remaining Timescheduling strategy. [Marks 6]
d) Let us consider that CPU remains idle for first 3 unit of time. In this situation, draw the Gantt chart and
calculate the average waiting time for a round robin algorithmwith q (time quantum) set at 2. Ignore the
effect of context switching time. [Marks 6]
Note:
i. In the above case we are considering only a single processor.
Uploading Instructions:
Upload your assignment as a word file. It should have name [YourRollNo.doc]. Your assignment must be
uploaded/submitted at or before Thursday, January 03, 2013
SEMESTER Fall 2012
CS604- Operating System
Total Marks: 20
Due Date:
Thursday,
January 03, 2013
Instructions
Please read the following instructions carefully before submitting assignment:
It should be clear that your assignment will not get any credit if:
o The assignment is submitted after due date.
o The submitted assignment does not open or file corrupt.
o The assignment is copied.
o There is not mentioned the student Id in the assignment File or
name of file is other than student ID.
GOOD LUCK
Marks: 20
Question 1: [Marks 20]
Let us consider a table given below.
Process Arrival Time Burst Time
--------------------------------------------------------------
A 1.0 9
B 1.4 5
C 2.0 2
Above table shows different processes arriving in the sequence listed in the table.
a) Let us consider that CPU remains idle for first 2 unit of time. Draw the Gantt chart and calculate the
average turnaround time for above processes in thissituation by using non preemptive Shortest Job
First (SJF)scheduling strategy. [Marks 3]
b) Let us consider that CPU remains idle for first 1.5unit of time. Draw the Gantt chart and calculate the
average waiting time for above processes in this situation by using non preemptive Shortest Job First
(SJF)scheduling strategy. [Marks 5]
c) Let us consider that CPU remains idle for first 1 unit of time and let us consider that a fourth process ‘D’
enters the system at time 3 and needs 1 unit of CPUtime. Draw the Gantt chart and Calculate the average
waiting time for four processes A, B, C and D in this situation by using preemptive SJFi.e. Shortest
Remaining Timescheduling strategy. [Marks 6]
d) Let us consider that CPU remains idle for first 3 unit of time. In this situation, draw the Gantt chart and
calculate the average waiting time for a round robin algorithmwith q (time quantum) set at 2. Ignore the
effect of context switching time. [Marks 6]
Note:
i. In the above case we are considering only a single processor.
Uploading Instructions:
Upload your assignment as a word file. It should have name [YourRollNo.doc]. Your assignment must be
uploaded/submitted at or before Thursday, January 03, 2013