Engineering BE Electronics and Telecommunication Sem 6 December 2018 2018 Oprating Systems Question Paper - Mumbai University | munotes

Questions asked in this paper

• Please check whether you have got the right question paper

1. Q2 Attempt any three questions from remaining five questions
2. Q3 Make suitable assumptions wherever necessary and state them clearly
3. Q1 a) Define a file system. What are various components of a file system? State and explain commonly used operations on file
   • b) What is the difference between a system call and an interrupt? 5
   • c) Give memory partition of and 600K(in order).How would each of the first 5 fit, best fit and worst fit algorithm place process of 212k,417k,112k,and 426k(n order)? Which algorithm makes the most efficient use of memory?
   • d) Write four optimizing criteria for CPU scheduling. 5
4. Q2 a) Consider the following page reference string How many page 10 faults would occur for the following page replacement algorithm assuming three and four frames? Remember all frames are initially empty:
5. Q1 FIFO
   • ii) Optimal
   • ii) LRU
   • b) Justify the need for process synchronization & Design a solution for producer consumer problem 10
6. Q3 a) Consider the following snapshot of the process to be executed. Draw the Gantt chart and determine the average. waiting time and average turnaround time for FCFS, SJF(non-preemptive) and round 10 marks
   • b) Consider the following snapshot 10 Answer the following using Banker's algorithm
   • (i) What is the content of matrix Need? the system in the safe state? the request from process PI arrives for (1,3,2,1) can request be granted immediately?
   • a) Suppose the head of moving-head disk with 200 tracks, numbered 0 to 199 is currently serving 10 a request at track 143 and has just finished a request at track 125. If the queue of requests is kept in the FIFO order 86,147,91,177,94, 150, 100, 175, 130 What is total head movement to satisfy these requests for the following disk scheduling
   • b) Explain working of EDF and RMA real-time scheduling algorithms. 10
7. Q5 a) What is the virtual memory? Explain with neat diagram the translation of virtual address into. physical address in a segmentation/paging system 10 marks
   • b) Explain process management in Linux. 10
8. Q6 a) State and explain the necessary conditions that lead to deadlock situation. 10 marks
   • b) Explain how LINUX performs file management. 10

Read from the scan above, so a character or two may differ. The scan is the original.