[Total No. of Ques. 05] Seat No: [Total No.
of Pages: 01]
G H Raisoni College of Engineering and Management, Pune.
(An Autonomous Institution affiliated to Savitribai Phule, Pune University)
S.Y. B.Tech (CSE-AI& CSE AIML) (SEM III)
ESE WINTER 2024 (2023 Pattern)
Operating System (23UAIPCL2302/23UAMPCL2303)
[Time: 2 Hours 30 Minutes] [Max. Marks: 60]
Instructions to the candidates:
1) All questions compulsory.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.
4) Assume suitable data, if necessary.
Q. Sub Marks CO BL
No. Question
1 a) Describe different types of system call with its benefits. [4] CO1 L2
b) State and explain various steps in boot procedure. [4] CO1 L2
c) Define operating system and explain various services provided by an [4] CO1 L2
operating system.
2 a) Draw and explain process state transition diagram. [3] CO2 L2
b) Explain context switching with the help of neat diagram. [3] CO2 L2
c) Solve: for the table given below calculate average waiting time and average [6] CO2 L3
turnaround time and draw gantt chart illustrating the process execution
using following scheduling algorithm
i) RR (time quantum: 2 units) ii) SJF iii) FCFS (Any 2)
Process Arrival Time Burst Time
P1 0 8
P2 1 5
P3 3 3
P4 4 1
P5 6 4
OR
d) Illustrate with neat diagram, the different types of schedulers in operating [6] CO2 L3
system.
3 a Explain necessary and sufficient conditions for deadlock to occur in a [3] CO3 L2
system.
b Apply producer-consumer problem using semaphores. [3] CO3 L3
c Solve dinning philosopher’s problem with suitable example. [6] CO3 L3
OR
d Solve Bankers algorithm work to avoid deadlocks [6] CO3 L3
Instances: A=10, B= 5, C=7
Process Allocation Max Need
A B C A B C
P1 0 1 0 7 5 3
P2 2 0 0 3 2 2
P3 3 0 2 9 0 2
P4 2 1 1 2 2 2
P5 0 0 2 4 3 3
4 a Explain various memory management techniques in details. [4] CO4 L2
b Explain the FIFO page replacement algorithm. [4] CO4 L2
c Compare paging and segmentation [4] CO4 L2
5 a Discuss the concept of file with various file operations with example [4] CO5 L2
b Describe free-space management(bit vector and linked list) with suitable [4] CO5 L2
example
c Explain Disk scheduling-FCFS, SSTF with example (any 1) [4] CO5 L2
