CS/IS52 USN Fifth Semester B.E. Degree Examination, July/August 2005 Computer Science / Information Science and Engineering Operating Systems Time: 3 hrs.| {Max.Marks : 100 Note: Answer any FIVE full questions. 1. (a) What is an operating system ? What are its goals ? What are the functions performed by it? (0 Marts) (b) Explain the distinguishing features of operating systems in : i) Multiprogrammed systems ii) Real Time Systems and iii) Hand Held systems. (6 Marks) () Usoinieadieds fron An GiGibiidesttenewsnhave. What are the services provided by operating systems ? (6 Marks) 2. (a) What is a process 7 With the help of a state-transition diagram, explain the various states of a process, (6 Marks) (b) Differentiate between short, medium and long term schedulers, __(@ Maris) (c) What are the benefits offered by cooperating processes? Describe the direct, and indirect interprocessor communication, (# Marts) 3. (a) For the following set of processes find the Average Waiting Time and Turn Around Time using Gantt Chart for : i) SIP, and ii) Priority (Non-preemptive, Small number indicates high priority) Process| Burst time] Priority PI 10 3 P2 1 1 P3 % 3 Pa eae fle 12) P5 5 2 ‘The processes have arrived in the order P1, P2, P3, PA and P5, all at time 0. (9 Marks) (b) What is meant by critical section problem ? Give its general structure. Explain the requirements that must be satisfied by a solution to the crit section problem. (6 Maris) ERR NcPage Now. 2 CS/Iss2 4. (a) How can deadlock be prevented ? (Marks) (b) Consider the following snapshot of a system : [ Process | Allocation] ss [x Ble 1D) fata ttp al ate pepetey FOP e ey Crs rst ey o fot Pa soy 214 P2 ij3]sla 2 3 $ z pe ots sta) fore pst BH fopoti ta} obets ey Using Bankers algorithm : a) What is the content of the NEED matrix ? b) Is the system in a safe state ? ©) If Pi requests for (0,4,2,0) can the request be granted immediately ? (6 Maske) (c) Discuss the issues related with recovery from deadlock. (6 Marks) 5. (2) With the help of a diagram explain the hardware support required for paging. What is the effective access time of paged memory ? (8 Masks) (b) Consider a system with 32-bit logical address space. If the page size is 4 is 2 bytes long, how much memory is and e4 entey in the miJownidaded Hoi UZiS iikemeomrr? (o Ma (c) Explain segmented memory management, (6 Marte) 6. (a) What is virtual memory 7 How can it be implemented ? What are its benefits ? (6 Marks) (b) Consider the following page reference string : 10710212303240302107 How many page faults would occur for FIFO, LRU and Optimal page replacement algorithms, assuming 3 page frames ? (8 Marks) (0) What is Thrashing ? How can it be controlled 7 (6 Marks) T. (a) Explain the ‘Tree Structured Directory and Acyclic Graph Directory structures with their advantages and disadvantages. (8 Marks) (b) Compare the Contiguous and Linked file allocation methods. (¢ Marke) (©) Suppose the head of moving disk with 200 tracks numbered 0-199. Suppose ‘the current request being serviced is for track 50 and the previous request serviced was for track 45. If the queue of requests is : 50, 45, 180, 35, 150, 5, 145, 51, 54 ‘What is the total number of head movements needed to satisfy these requests using the SSTF and SCAN algorithms ? (6 Mares) 8. (a) Discuss the use of passwords as a mechanism for protection. (20 Marks) (b) Deseribe the following components of Linux operating system : 4) Process scheduling ii) Main memory management (20 mass) eke okPage No... 1 CS /I1S52 USN | Fifth Semester B.E. Degree Examination, January/February 2005 Computer Science / Information Science and Engineering Operating Systems ‘Time: 3 hrs | IMax.Marks : 100 Note: 1. Answer any FIVE full questions. 2. All questions carry equal marks. 1. (a) Distinguish between multi-tasking and multi programming operating systems. (A Meeks) (b) Explain features of multi-processor systems. (0 Mors) (c) List the various operating system services. (4 Maris) (d) Explain the virtual machine system model along with its benefits. (6 Marks) 2. («) qwnloaded fram. Athikivha.com (6 Marts) (b) Define any four scheduling criteria. (4 Marks) (c) Consider the following set of processes with a length of the CPU burst time given in milliseconds. Process] Arrival time| Burst time] Priority PL 0 7 3 P2 3 2 2 | P3 4 3 a Pa 4 1 L P5 5 3 3 i) Draw Gantt charts illustrating the execution of these processes using SRTF, Preemptive priority and round robin (time slice = 1ms). ii) Compute the waiting times in each of the three schedules in i) and find which of them provides results in the minimal average waiting time and turn around time. iii) Find out the time of which there are maximum umber of processes in ready queue in the above scenario. (10 Marta) 3. (a) Give an algorithm for critical section problem involving at least 2 processes satisfying all necessary and sufficient conditions. Modify the same algorithm ‘using semaphores. (10 Marks) (b) Define the dining philosopher’s problem and give a solution for the same using a monitor. (10 Maris)Page No... 2 CS /1s52 (b) Consider the following stap-shot of a system, Process] Allocation] Max _|ABoDIABCD po [ooi2z|ooi2 Pi [ieooli7zso pr [1354/2356 Ps [oo 32/0052 pa [ooislo6s56 ‘The available resources are A = 1, B= 5,C = 2and D0 i) What is the content of matrix NEED ii) Is the aystem in SAFE state? If so give the SAFE sequence iii) If a request from a process P1 acrives for (0.4 2 0), can the request be granted immediately? (10 Maris) 5. (a) Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, 600 KB (in order), how would each of the first fit, best fit and worst fit algorithms place processes of 212 KB, 417KB, 112K B and 426KB (in order). Which algorithm makes the most efficient use of memory ? (6 Maske) fubicomnern wtea kde physical megnon 2 fyagne. How 10 igs here in Li IOaded TORT AES hike shia. (c) Consider the following page reference stream 1) 8c h, © Beds H 8156 2, BB How many page faulis would occur for LRU, FIFO and Optimal replace- sent algorithms, assuming 3 and § frames? Which one of the above is most efficient (0 mares) ce of & pages of 1024 words each mapped onto a ical and physical (4 Marts) 6. (a) What is thrashing? Bxplain how working set model ean be used to solve the same. (e Maske) (b) What are the different fle types? Give their functions with an example for cach. (30 Maske) (c) Explain indexed file allocation method. (4 mthnns) 7. (a) What is access matrix! Expinin how the access matrix is implemented effectively. (00 tae) (b) What are the different user authentication methods? Explain any two of them. (36 Barks) Write short notes on : i) Process control block ii) SCAN and CSCAN disk scheduling iii) UNIX file system iv) Inter process communication in UNIX. (20 Masks) Ak be