Operating System Past Paper PDF - Winter 2022

Note: 1. All questions carry marks as indicated 2. Solve Question 1 OR Questions No 2 3. Solve Question 3 OR Questions No 4 4. Solve Question 5 OR Questions No. 6 5. Solve Question 7 OR Questions No S 6. Solve Question 9 OR Questions No 10 7. Due credit will be given to neatness and adequate d...

Note: 1. All questions carry marks as indicated 2. Solve Question 1 OR Questions No 2 3. Solve Question 3 OR Questions No 4 4. Solve Question 5 OR Questions No. 6 5. Solve Question 7 OR Questions No S 6. Solve Question 9 OR Questions No 10 7. Due credit will be given to neatness and adequate dimensions 8. Assume suitable data whenever necessary 9. Illustrate your answers whenever necessary with the help of neat sketches 1. a) Explain the types of operating system. b) What is system call Discuss various types of system calls. OR 2. a) Explain following Disk Space allocation methods. b) Suppose a disk drive has 200 cylinders, numbered from 0 to 199 The drive is currently serving a request at cylinder 50 and the previous request was at cylinder 10 The queue of pending request in FIFO order is 82 170, 43, 140, 24, 16, 190 Starting from the current head position, what is the total distance that the disk arm moves to satisfy all the pending requests for the following algorithm. i) SSTF ii) SCAN iii) LOOK iv) MC-LOOK 3. a) Explain the concept of process control block, with neat diagram. b) Consider the following set of process with length of CPU burst time gives in millisecond. Process Arrival Time Burst Time Priority 1 0 15 2 2 2 3 1 3 5 5 5 4 6 8 4 5 7 12 3 Give Gantt and calculate the average waiting time for i) FCFS ii) SJF iii) Round Robin (Slice = 4 ms) iv) Priority scheduling algorithm OR 4. a) Explain the long-term and medium term schedulers. b) Draw the state transition diagram of process and explain each sate in detail. 5. a) Explain segmentation as a non contiguous memory allocation scheme. b) Explain paging. How it is implemented What hardware is required? OR 6. a) Calculate how many page faults will occur for the following algorithms applied on given reference string with three page frames: 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9 i) FIFO ii) Optimal iii) LRU page replacement b) What is memory fragmentation ? Explain internal and external fragmentation. 7. a) Explain any two classical problem of synchronizations. b) What is the critical section problem Explain the three conditions that a solution to a critical section problem must satisfy. OR 8. a) Define the following any two. i) Race condition ii) Mutual Exclusion iii) Semaphore iv) Busy waiting b) What is mutual exclusion ? How the semaphore used to solve the critical section problem 9. a) Explain various directory structures in detail. b) Discuss the various file Access methods. OR 10. Solve the following using Banker's Algorithm and find out whether resultant system state is safe or not. Allocation Max Available A B C A B C A B C P0 0 1 0 7 5 3 3 3 2 P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3 i) Find out if system state is safe, if safe find out safe sequence. ii) If P1 makes a request – P1 (1,0,2) is the resulting state safe ? iii) If P4 makes a request – P4 (3,3,0), can it be granted? Solve.