B.Tech.
(Computer Science and
Engineering) Semester-III
Subject: Operating System (BCO 0008A)
Marks: 64
Assignment #2
Section A Answer the following Questions: (5*2=10 marks)
1. [CO2]What is a process? Define different states of process.
2. [CO2]What is Dispatcher?
3[CO3] Define the following:
a) Burst Time
b) Waiting Time
c) Turnaround Time
d) Arrival Time
4.[CO2]what is scheduler?
5.[CO2] write short note on starvation.
Section B Answer the following Questions: (7x3=21Marks)
1. [CO2] Differentiate preemptive and non-preemptive scheduling algorithm.
Consider the set of 5 processes whose arrival time and burst time are given be- low-
Process Id Arrival time Burst time
P1 3 1
P2 1 4
P3 4 9
P4 0 6
P5 2 5
Last Date of Submission: 22/09/24
B.Tech. (Computer Science and
Engineering) Semester-III
Subject: Operating System (BCO 0008A)
Marks: 64
Assignment #2
If the CPU scheduling policy is SJF preemptive, calculate the average waiting time and
average turnaround time.
2. [CO2] Explain the process management in UNIX operating system.
3. [CO2] Differentiate between: Long Term, Middle Term and Long Term Schedulers.
Section C Answer the following Questions: (11x3=33Marks)
1. [CO2] What is thread? Differentiate between user level and kernel level threads.
Explain the concept of multithreading model with suitable diagram.
2. [CO2] Consider the set of 5 processes whose arrival time and burst time are given
below-
Priority
Process Id Arrival Burst time
time
5
P1 1 11
2
P2 1 6
3
P3 6 1
4
P4 3 6
1
P5 8 3
If the CPU scheduling policies are FCFS, SJF, preemptive priority and Round Robin with time
quantum = 2 unit, calculate the average waiting time and average turnaround time.
3. [CO3] Explain in detail: Process Control Block. (PCB)
Last Date of Submission: 22/09/24
