Scribd
Upload
50 views2 pages

Operating System (23UDSPCL2303)

question bank

Uploaded by

dohofe3551
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views2 pages

Operating System (23UDSPCL2303)

question bank

Uploaded by

dohofe3551
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

G H Raisoni College of Engineering & Management, Pune

(An Autonomous Institute affiliated to SP Pune University)

S.Y. B. Tech. /Semester- I/Div-A/2024-25


Computer Science and Engineering (CS and DS)
Operating System (23UDSPCL2303)

Questions BL CO PO
Q1 Define critical section problem? Explain with example? 1 3 1
Q2 Illustrate Semaphore with producer consumer problem using 2 3 2
semaphore?
Q3 Define process synchronization and explain Peterson solution 1 3 1
algorithms?
Q4 Explain Monitor with any example using monitor? 1 3 1
Q5 Discuss the solution for Dining-Philosophers Problem? 2 3 2
Q6 Examine deadlock and starvation? 4 3 2
Q7 Describe Deadlock Avoidance? 2 3 1
Q8 Discuss the methods for handling deadlock? 1 3 1
Q9 Illustrate the Dead lock detection (Banker’s Algorithm) with Example? 4 3 2
Q10 Discuss Deadlock Prevention Methods? 2 3 3
Q11 For FCFS scheduling imagine three processes with the following burst 4 3 3
times, draw the Gantt chart and calculate average turnaround time and
average waiting time for each process
Process P1 P2 P3
Burst time 24 3 4

Q.12 For Shortest Job First, Consider the set of 5 processes whose arrival 4 3 2
time and burst time are given below. Draw the Gantt chart and calculate
average turnaround time and average waiting time for each process.
Process P1 P2 P3 P4 P5
Arrival 3 1 4 0 2
Time
Burst 1 4 2 6 3
Time

Page 1
Q13 Consider the set of 5 processes whose arrival time, burst time and 4 3 2
priority are given below. If the CPU scheduling policy is priority
non-preemptive. Draw the Gantt chart and calculate average turnaround
time and average waiting time for each process.
Process P1 P2 P3 P4 P5
Arrival 0 1 2 3 4
Time
Burst 4 3 1 5 2
Time
Priority 2 3 4 5 5

Q14 Illustrate the difference between logical and physical addresses? 3 4 1


Q15 Define paging? discuss basic paging technique? 1 4 1
Q16 Discuss address binding in memory management? 1 4 2
Q17 Elaborate Hardware Address Protection with Base and Limit Registers 2 4 3
with diagram?
Q.18 Demonstrate Fixed size partition and variable size partition? 4 4 3
Q.19 Describe physical address space and logical address space? 1 4 1
Q.20 Elaborate Memory management unit? 2 4 2
Q.21 Apply Banker’s avoidance algorithm to generate safe sequence 4 3 3
Consider 5 Processes P0 to P4 with resource type with instances A=10, B=5
and c=7 with following data.

Q.22 Apply Banker’s detection algorithm to detect system in safe state or in 4 3 2


deadlock state, consider 5 Processes P0 to P4 with resource type with
instances A=7, B=2 and c=6 with following data .

Blooms Taxonomy level 1: Remember, 2: Understand,3: Apply, 4: Analyse, 5: Evaluate, 6: Create

Page 2

You might also like