Code No: 220503II B.Tech., II Semester Supplementary Examinations, November-2003OPERATING SYSTEMS(Common to Computer Science and Engineering, Computer Science and InformationTechnology, Computer Science and Systems Engineering)Time:3 hoursMax Marks:80Answer any Five QuestionsAll questions carry equal marks.----
1.a) DMA access to main memory is given higher priority than processor access to mainmemory. Why? Explain with an example. b)Explain the characteristics of Two level memories.2.a) Define the following:(i) Process (ii) Program (iii) Process state (iv) Process control block (v) Process Scheduling.b)Explain the process State Transition diagram with examples.3. Explain the various mechanisms provided by UNIX for inter processor communication and synchronization in detail.4.a) What are the conditions that must satisfy for deadlock occurrence and explain them.b)Is the deadlocks problem preventable? Justify your answer with example and diagram.5.a) Explain the concept of page buffering. Substantiate its need in paging.b) Discuss the relation between Replacement policy and cache size.c) Enumerate the factors that influence when an Operating System decides thequantum of main memory to be allocated to a particular process.d) Write short notes on fixed allocation.6.Suppose we have a disk with 200 tracks. The disk head starts at track100, and moving inthe direction of decreasing track number. For the following sequence of disk track requests 27, 129, 110, 186, 147, 41, 10, 64, 120, compute the average seek time for thefollowing disk scheduling algorithms FIFO, SSTF, Scan, C-Scan. Queue contains thefollowing request in order at time 0, 27,129,110,186,147, 41, 20, 64, 120. Compute theaverage time to service a request for the disk head scheduling algorithm FCFS.7.Write short notes on:(a) Sequential file (b) Indexed file (c) Indexed sequential file (d) Direct file.8.Write short notes on:(a) Trojan Horse defense (b) Trojan horses.!!!!!