1312 ‘Course Code : 121503 (To be filled itt by the candidatey PSG COLLEGE OF TECHNOLOGY, COIMBATORE = 641 004 SEMESTER EXAMINATIONS, OCTOBER/NOVEMBER - 2014 Bech - INFORMATION TECHNOLOGY — Semester : 5 121503 OPERATING SYSTEMS Time : 3 Hours Maximum Marks: 100 INSTRUCTIONS: Aa cn Aa ial T. Group 1, Group Hand Group Book, Ignore the box tied as “Answers for Grow III” in the Main Ansiwer Book. Answer ALL questions from GROUP ~ L Answerany 5 questions from GROUP ~ IL Answer any ONE Question from GROUP. ‘questions should be Atiswered in the Main Answer veep GROUP-1 ‘Marks: 10x 3=30 1, How will the process. a0cess and invoka the privileged operations? State thé types with example 2. ‘Siate the reasons why a mode switch between threads may be cheaper than a mode switch between. processes? How do you group the system calls? List them with examples. Consider three précesses P= (P1,)P2, Pa}, resources R= (Ri, R2, A, Ra}, Instance of resources (RI — 1 ,A2— 2 |AI— 1, R4— 3} with Edges defined as {P13R1, PISR2, P25A3, R25P1, Ri>P2, RISP3, R2SP2}.For the data given above, fam a Resource Allocation Graph. Find whether deadiock is possible in the Resoure Allocation Graph that is formed. Niustrate the wait and signal operations implemented ona semaphore. In computer’ system where the best fit algorithm is used for allscating jobs to memory Partition, when will the 20K job get completed for the following situation encountered? Pariiion Ses inKB | 4K | 8K [20K | 2k Job Sizes in KB 2K | 14K 3K [6K [6K] 10K [20K [2K Time Tor execution a] 2 |t |4)|1 |e {6 7. Compare 0 based polling with interrupi-driven I/O. In what situation would you favour one technique over the other? 8. List the services provided by kemel UO 9. On a'system that mounts file systems on individual devices into a single file system, a floppy disk has been mounted at point /usermount If the floppy's file system contains @ file by name of /data/jan, what will that file's name be in the overall fle system? State the concept behind file mounting. 10. Give anexample of an application in which data of a file should be accessed sequentially and randomly and state the access methods, Page No: L1312 No of Pages : 3 ‘Course Code : 121503 tah >) 12.) 13. a) b) 14, a) by 15. a) b) 16, a) b) °) GROUP -I Marks : 3x10 =50 How is a layered approach diflerent from a siftiple structure ol/an operating system? Sketch the two structures, (5) In multiprogramming and time-sharing environment, several users sharé the system simultaneously. The situation can result in various security preblems. (1) State the twa security problems? (2) (ii) Can we ensure the samé degree of security in a time-shared machine as.we have in.a.dedicated machine? (3) Discuss the concurrent and cooperating process using the preducer consumer problem: (5) Explain the Synchronization support for conictimency problems using hardware: (5) Give ‘a detailed description about combination of Segmentation and Paging. On a system using Paging and Segmentation, the virtual address space consists of up to.8 ‘segments where each segment can be up to 2*bytes long. Size of each page is 256 bytes, What i$ the approximate virtual address, space? (4) Base: limit MMUs can‘support swapping, What is swapping? Can swapping permit an application requiring 16M memory to run on a machine with BMaf RAM? Give some advantages of a system with page-based virtual memory comparadto-a simple system with base-limit registers that implements swapping. @ Compare and contrast the Various features of memory management residing in Windows arid Linux Operating systems. (4) Consider a main’ memory witha capacity of 4 frames, Assume that ihe pages of a process is referenced in tha order as givan 123.2,56,3,46,3,7,3,159,63,424,3,4,51 which. among LAU, Optimal and FIFO would:be a beiter page replacement straiegy? Justify with reasons. (6) Elaborate the various allocation methods to manage file storage stating their advantages and disadvantages. (4) Consider-ihe head of the\moving-head disk, with 200 tracks,-numbered 0 to 199.18 curently serving a request at track 143. 1 the queue of request is waiting in the following order 62, 44, 10, 155, 161, 6, 19, 31, 56, 35. What are the total head movements to satisly these requests fer the following disk scheduling algavithms? (6) () FOFS, (i) SSTF (i) CLOOK (iv)SCAN Consider ‘two programmers working on a joift project, Suggest'a directory structure Suitable tor them with reasons. State the problems caused in using the files under this directory structure. Explain the other directory structures available. ry Iustrate how the RAID siructure improves the disk reliability and data-iranster rate. (3) Explain swap space management, State the use of swap-space and its limitations. 19) Page No: 21312 No of Pages : 3 ‘Course Code : 121503 GROUP - IIL Marks : 1x20=20 17. Consider the following JOBS to execute with one processor, with the jobs arriving in the ordar listad below. Process | Arrival time | Burst time ) Priority 7 4 5 3 2 0 S 0 a i i 2 fa 2 ava a Using FCFS, SJF,SRTN and Priority based CPU “Scheduling algorithm, evaluate the tollowing, a) State ‘the’ scheduling criteria used (2) b)-Create a Gantt chant ilustrating the execution of these pracesses. @) ¢) Calculate the’ waiting and tumaround time tor each of the processes and average walting time and average turnaround time for the processes. (@) d) State your observation related to the performance of the above scheduling algorithm. (4) 18,.A: system has 3."A', 10 ‘B", and.5:“C" resources:“Their current allocations and their ‘maximum allocations are shown belaw with available resources (1, 4, 2) PROCESS | MAX | ALLOCATION AyB|C|A |B [Cc PO T/5/3|1,73 [0 PI 2/2(s{o |= fo | Pa 2lalel1 fo jae P3 o/6|4|o |i |i Answer the folowing questions using Banker's Algorithms. i) - Slate Banker's Algorithms. 5) il) What is the content of the matrit Need? (4) il Is the system in a safe stata? (If yes, then determine a sale sequence) (6) iv) tha request from provess P1 arrives. tor (0, 4, 2}, can the request be, granted immediately? Justily your answer, It yes, show the new system state after allocation is made and determine a sale sequence. (5) /END/ FD/RL Page No: 3