Os Winter 2024
Os Winter 2024
/Seat No_______________
Q.4 (a) Explain the difference between logical and physical addresses. 03
(b) What is TLB(Translation Lookaside Buffer), and what is use of it? 04
(c) Explain following process scheduling algorithms. 07
i) First Come First Serve
ii) Non-preemptive Shortest Job First
iii) Shortest Remaining Time Next
iv) Round Robin
OR
Q.4 (a) What is virtualization? Explain the benefits of virtualization. 03
(b) Define Virtual Memory. Explain the process of converting virtual addresses to 04
physical addresses with a neat diagram.
(c) Consider a Swapping system in which memory consists of the following hole 07
sizes(in MB) in memory order: 10, 4,20,18,7,9,12,15.
Which hole is taken for successive segment request of 12 MB and 10 MB for
First fit, Best fit, Worst fit and Next fit.
1
OR
Q.5 (a) Explain I/O buffering in brief. 03
(b) Explain Disk arm scheduling algorithms. 04
(c) Explain the Banker’s algorithm for deadlock avoidance with an 07
example.
***********