pee 19ECE25 Reg. No. (To be filled by the candidate) (2019 BATCH) COIMBATORE INSTITUTE OF TECHNOLOGY (Government Aided Autonomous Institution) COIMBATORE 641 014 B.E, DEGREE EXAMINATIONS, JUNE 2022 (Sixth Semester) ELECTRONICS AND COMMUNICATION ENGINEERING BRANCH 49ECE25 OPERATING SYSTEMS Time : 3 Hours Max: 75 marks INSTRUCTIONS 1. Answer all questions in PART A and as per choice in PART B. 2. Part A and Part B questions should be answered separately in the same answer sheet. (10X2=20) 1 Differentiate between Distributed Systems and Real Time Systems. 2 List some of the system calls. 3 Draw the process transition diagram. 4 Differentiate preemptive and non-preemptive scheduling techniques. 5 ‘What are the requirements to solve the critical section problem? 6 What are the conditions under which a deadlock situation may arise? 7 Why page sizes are always powers of 2? 8 ‘What is the cause of thrashing? 9 ‘What are the different accessing methods of a file? 10 Define seek time and latency time. PART-—B (5X 11=55) 41a) Discuss on the objectives and functions of Operating Systems. 6) b) Explain the services provided by the operating system for efficient system operation. (6) (OR) 12 a) Explain the features of Macro Processor. (6) b) Een in detail the system call sequence to copy the contents of one file to another (6) fle. 13 a) Discuss the role of Process Control Block (PCB) in Operating Systems. © b) Explain why spinlocks are not appropriate for uniprocessor systems and may be (6) ‘suitable for multiprocessor systems. (OR) Contd...44 15 16 7 18 19 20 ‘Assume the following workload in a system: (11) Process [Arrival Burst Time(ms) Time(s) Pt 5 5 = P2, 4 6 Time. Quen bum P3 3 7 P4 4 9 PS 2 2 Qe3 PS 6 3 [pet Draw a Gantt chart illustrating the execution of these jobs using Round robin ‘scheduling algorithm and also Calculate the average waiting time and average tumaround time. 2) Define the hardware instruction TestandSet() and Swap(). Also give the mutual (5) exclusion implementation with test and set( ) instruction. ) Write and explain the solution for Reader-Writer classical synchronization problem. © (oR) Consider the following snapshot of a system: a) Allocation ‘Max Available Aged ngco ABCD po ggi2 og12 1520 pL ogg 1750 p2. 4354 2356 p36 832 0652 pe 9.024 0656 ‘Apply banker's algorithm and answer the following 4. What is the content of the matrix Need? 2. Isthe system in a safe state? FFP arequest from process P1 arrives for (04,2,0), can the request be granted immediately? Given free memory partitions of 100 K, 500 K, 200 K, 300 K, and 600 K (in order), how (14) would each of the First-ft, Best-fit, and Worst-fit algorithms place processes of 212 K, 417 K, 112 K, and 426 K (in order)? (oR) Define Virtual Memory. Explain the process of converting virtual addresses 19 physical (11) addresses with a neat diagram, Discuss on file organization and file directories. (11) (oR) 'A disk drive has 200 cylinders, numbered 0 to 199. The drive is currently sereng * ay Fequest at eylinder 53. The queue of pending requests, in FIFO order, is 98, 183, 37, 422, 14, 124, 65, 67. ‘Starting from the current head position, what is the total distance (in cylinders) that the Starting romoves. to satisfy all the pending requests for each of the following disk-scheduling algorithms? 1) FCFS ii) SSTF ii) SCAN