(b) Consider the following, system ws Ri Re RL Re Ro po} 2 22 0 Poo 0 23 0 2 Po4 3 3 8 8 Identify, if the system is in safe state or not 0 6. (a) Suppose 8 MB RAM is connected in the system, Program of the size 2 MB is to be executed and size of the page is 16 KB. Compute number of bits in logical address, physical address, page number, frame number and displacement. 07st 4 (180.CU-106931) Rall No. PAPER ID—10781 B. Tech. (CSE) EXAMINATION, 2023 (Fourth Semester) OPERATING SYSTEM me :3 Hours Maximum Marks : 75 Before answering the question-paper candidates should ensu that they have been supplied to correct nd complete question-paper: No complai regard, will be entertained after the examination Note : Attempt Five questions in all. Q.No. 1 is ‘compulsory. All questions carry equal marks. 1. (a) Define operating system as a resource manager and res (©) Discuss Starvation, Which CPU Scheduling algorithms suffer from starvation ? 2s ce allocator, 2.5 ‘emo F078 Pro.(©) Define all necessary conditions for deadlock 28 (@) Differentiate between physical address space and logical address space. 2.5, (©) Discuss a scenario where worst fit allocation scheme is better than first fit and best fit. 28 (8) Define volume control block. 2s 2 Consider the following processes Process ID Arrival Time CPU Burst Time Po 6 5 Pi 3 2 P2 o ° P3 6 5 Pa n 2 Ps 5 2 Po 2 10 ‘Compute numbers of context switches (ignore first and last context switch), average waiting time, average turnaround time and throughput 07st 2 if processes are executed using Round Robin Scheduling Algorithm. Time Quantum a= 2 ms 1s 3. Write short notes on the following > S+5+5 (a) Schedulers and its types (0) Threads (©) Realtime Systems 4. (a) Define sleeping Barber's problem. Discuss the solution which satisfies all three eriteria-mutual exclusion, bounded waiting me and progress, (b) Review the statement, “Cyele in Resource Allocation Graph is necessary but not a sufficient condition for deadlock” Discuss various deadlock recovery schemes, 1045 5. (a) Define race condition with a example, 5 ‘cmon E4078 3 Pro.9. Consider the following disk request sequence for a disk with 100 tracks-98, 137, 122, 183, 14, 133, 65, 78. Head pointer starting at $4 and moving in left direction. Find the number ‘of head movements in cylinders using SCAN and SSTF scheduling algorithms. 1s 07st 6 180 ) o o Discuss internal fragmentation and extemal fagment variable partition contiguous memory ‘management scheme 75475 ion with reference to Consider a main memory with three page frames and the following sequence of 3,9, 1,6,3,8, 9, 3, 6, 2, 1, 3. Find out the number of page faults in case of optimal page rep Consider a paging hardware with a TLB for accessing the page from the main ‘memory, it takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, then calculate effective memory access time (in milliseconds). 7.5+7.5 page references : 3,8, nt algori Discuss directory structure and its types of any file systen Discuss various allocation methods for List their advantages and limitations. 18 ‘smn E4078 5 Pro.