Programme: B.E./S.E/IT Full Marks : 100 Course: Applied Operating Systems Time : 3hrs. Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks. Attempt all the questions.
1. a) What are systems calls? Classify them. 5
b) Explain how java Virtual Machines works. 5 c) What are processes? What are the general operations of a process? 5 List them. 2. a) What is IPC? Define the role of buffering in process synchronization 5 b) Suppose six online batch jobs arrived at schedule with following 10 information. Compute the average turn around time (ATAT) and average waiting time (AWT) for a. FCFS b. SJF c. RR (quantum size) d. Priority scheduling algorithms.
PID Arrived at Demand Priority
P1 0 10 3 P2 7 5 2 P3 10 8 4 P4 10 12 1 1 being the highest priority and quanta size 5. 3. a) What are the conditions for deadlocks? What are different deadlock 8 handling methods? Describe briefly. b) What is swapping? Differentiate contiguous memory allocation with 7 non contiguous memory allocation. 4. a) What are LDT and GDT? Explain by diagram how the Intel x386 8 architecture translates the address. b) For the page reference string 9, 3, 5, 4, 9, 1, 9, 5, 1, 9, 3, 7, 9, 3, 4, 1. 7 1 How many page faults would occur for each of the following page replacement algorithms assuming 4 frames? i LRU page replacement ii FIFO page replacement iii MFU page replacement iv Optimal page replacement 5. a) List the common file attributed and describe the schemes of logical 8 directory structures with diagram. 7 b) What are tertiary storage devices? Explain briefly, the working of magnetic disks. 6. a) What do you mean by disk management? Compare sector Slipping 7 and Sector Sparing in bad block recovery during disk management. b) The head of the moving disc system with 200 tracks numbered 0 to 8 199 is currently at track 19 and has just finished a request at track 8. The request queue is: 7,23, 17, 78, 190, 34, 56, 78, 153, 1 7. Write short notes (Any Two) 5x2 a) Java Threads b) Demand Paging c) Deadlock