ITE 2202 36 UNIVERSITY OF MORATUWA Faculty of Information Technology 2) Bachelor of Information Technology (BIT) Sone Level 2 ~ Semester 1 Examination ITE 2202 ~ Operating Systems Time Allowed: 3 hours October 2019, INSTRUCTIONS TO CANDIDATES 1. This paper contains 4 questions on 3 pages (Including this page). 2. The total marks obtainable for this examination is 100. The marks assigned for each question & sections thereof are included in square brackets. 3, This examination accounts for 70% of the module assessment. 4, This is a closed book examination. 5. Answer ALL questions. ADDITIONAL MATERIAL None. Continued... Page 1 of 3ITE 2202 Question 01 (®) Briefly explain the importance of an interrupt in an operating system. Explain how an interrupt is handled by an operating system. [6 Marks] (b) Briefly explain what is meant by multiprogramming in operating systems using suitable diagrams. [6 Marks] (©) Explain the difference between privileged mode and non-privileged mode in an operating system by using suitable diagrams. (6 Marks] (d)_ Briefly explain the essential components in a Process Control Block (PCB) by using a suitable diagram. [7 Marks] juestion 02 (a) Explain two advantages of the virtual machine by giving examples. [6 Marks] (b) Explain the difference between the short-term scheduler and the long-term scheduler by using suitable diagrams. [6 Marks] (©) Explain the role of the context switch by using a suitable example B Marks] (@)_ Briefly explain the layered approach in operating systems design. LE Marks] (©) Briefly explain the one-to-one thread model by using a suitable diagram. B Marks] Continued. Page 2 of 3ITE 2202 Question 03 (a) Suppose that the following processes arrive for execution at the times indicated in Table Q3 below, Each process will run for the duration given. Length of the CPU burst and the arrival time to the ready queue are given in milliseconds. Table Q3 Process Arrival Time Burst Time Pl 0 15 P2 2 22 P3 7 4 4 12 10 Draw a Gantt chart to illustrate the execution of the above processes using each algorithm. mentioned below and calculate the response time and turnaround time for each process. Also, determine the average response time and turnaround time for cach algorithm mentioned below. (i) First Come First Serve (FCFS) B Marks] (i) Round Robin with a time quantum of 8 milliseconds. [6 Marks] () Briefly explain what is meant by readers-writers problem in process synchronization using suitable examples. (6 Marks] (©) Explain how semaphores can be used to solve the process synchronization problem. [8 Marks] Question 04 (@) Define the terms deadlock and safe state, ‘4 Marks] (b) “If we can find at least one safe state for a given set of processes, then the processes will never go into a deadlock”. Justify the statement by using a suitable example. [7 Marks] (©) Briefly explain a deadlock detection algorithm by using suitable examples. [8 Marks] (@ Name three major activities of an operating system that relate to the file management and briefly describe why each is required. [6 Marks] End of Paper Page 3 of 3