EAST WEST INSTITUTE OF TECHNOLOGY
DEPARTMENT OF INFORMATION SCIENCE & ENGINEERING INTERNAL ASSESSMENT – II
Semester III Subject Name Operating System Duration 1 hour
Date 31/1/2024 Subject Code BCS303 Max. Marks 25
CO1:
(Instructions to Students: Answer any two Full Questions. Each question carries 12.5 Marks)
Sl.
No
Sub . Q.
No.
Questions Marks CO LEVELS
1 a
Consider the set of process with Arrival time, CPU burst time (in milliseconds) and priority shown below (Lower number represents higher priority).
Write the Gantt chart and solve the Average waiting time and Average turnaround time for
i) SJF Scheduling (Preemptive).
ii) Priority Scheduling (Preemptive).
(NOTE Consider Arrival Time for both Algorithms).
Process Arrival Time Burst Time Priority
PI 0 10 3
P2 1 1 1
P3 2 2 4
P4 3 1 5
P5 4 5 2
12.5 CO2 L2,L3
OR
2 a With respect scheduling algorithms explain the following terms:
i) Turn Around Time.
ii) Waiting Time.
iii) Preemptive Scheduling.
iv) Non Preemptive scheduling.
v) Burst Time.
6 CO2 L1,L2
2 b Consider the following processes with CPU burst time given in milliseconds, Writhe Gann chart and calculate the average turnaround time and average waiting time for the Round Robin algorithm considering Time Quantum=1 millisecond.
6.5 CO1 L2,L3
Process Arrival Time Burst Time
PI 0 8
P2 1 4
P3 2 9
P4 3 5
3 a What is synchronization? Explain its importance. 6 CO3 L1,L2 3 b Explain Critical section problem, what are the requirements that
critical section problem must satisfy. 6.5
CO3 L1,L2
OR
4 a With an algorithm explain Peterson’s solution for critical section
problem. 6
CO3 L1,L2
4 b What are semaphores? Explain its usage and implementation. 6.5 CO3 L1,L2
Signature of Faculty Signature of HOD
Dr. Suresh M B