[aE es . _ 11001TT303122103 Pages: 4 Reg No. ia fame: Fav eoee a APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY ter B.Tech Degree Regular and Supplementary Examination December 2022 (2019 Scheme) Course Code: ITT 303 Course Name: OPERATING SYSTEM CONCEPTS tar Mest 100 Duration: 3 Hours PARTA (Answer all questions; each question carries 3 marks) What is the type of operating system used for scientific experiments, medical 3 Marks imaging systems, weapon systems, robots etc? Mention its characteristics. What are the different types of kernel designs in operating systems? Differentiate process and threads. Why are the threads called light weight 3 @ * process? What are the different scheduling criteria? What is a critical section?State the criteria to be satisfied for avoiding race condition Whaat are the various mechan ms used for preventing deadlock? What is demand paging? What are its advantages? ‘What are different algorithms for allocating memory to process? 204 QA a How are directory structures implemented in Operating system? Define seek time, rotational latency and transfer time in disk scheduling, & PARTB (Answer one full question from each module, each question carries 14 marks) Module -1 12 terminologies associated with the operating 11 a) Distinguish among the follow system and explain each of them in detail (i) Multiprogramming systems (ii) Multitasking systems ¢ (iv) Real time systems. Multiprocessor systems. Page 10f4110017T303122103 b) What is a system call? How many child process will be created for the following 6 code? Justify your answer. void main() { fork(); fork(); fork(); printf“Hiln”); fork; printf(“How are you\n”); } 12a) _ Differentiate kernel and shell. @ b) Explain in detail about various functions of operating systems. 9 Module -2 13a) Consider the set of 5 processes whose arrival time and burst time are given 10 below. 3) 1) __ Ifthe CPU scheduling policy is priority pre-emptive, calculate the average waiting time and average turnaround time. (Higher number Sel sher priority STF ee, cy Draw aed chart fra CPU scheduling policy is SRTF. J, ie PPV. “Tl Process | Arrival time Burst time Priority PI 0 4 2 Z a PZ 7 3 3 P3 2 1 4 Pa 3 3 3 D PS 4 2 5 She 14 1A) Explain about different queues associated with scheduling? a) b) With a neat diagram explain different process states. ~ Jf, Ss 4 Three process pl, P2 and P3 arrive at time zero. Their total execution time is 8%. Sz 10ms, 15ms, and 20ms respectively. They spent first 20% of their execution time We in doing /O, next 60% in CPU processing and the last 20% again doing /O. For / aN what percentage of time was the CPU free? Use Round robin algorithm with K ° time quantum Sms to find average waiting time. Yo, 7. 9 z BD “0% Fe “X\S Page 2 of 4 ye110017T303122103 Module -3 a) Explain strict alternation method in mutual exclusion with busy waiting. b) Discuss an algorithm for detecting deadlock in systems with a single instance of ‘each resource type. What are the methods used for deadlock recovery? a), WASt are the necessary conditions for deadlock to occur? How deadlock can be odelled? ») CX computer system uses the Banker's Algorithm to deal with deadlocks. Its current state is shown in the tables below, where PO, P1, P2 are processes and RO, R1, R2 are resource types. Current allocation Max need Available RO RI RZ RO Ri R2 Ro RT RD pof4 |i 2 po[i ]o 2 2218 pifi {5 [1 pifo [3 [1 p2/1 [2 [3 p2{r fo |2 |. Show that the system can be in safe state. Determine the safe sequence. What will the system do on an additional request by process PO for one unit of resource type R1? a Module -4 a) Explain virtual memory in Operating system. What is demand paging? How paging is different from segmentation? Does paging causes internal fragmentation? yo What is a page fault? What does the operating system do in case of page fault? 6) Consider the page references 7, 0, 1,2, 0,3, 0,4, 2, 3, 0,3, 2, with 4-page frame, 19 Find number of page fault in Optimal Page replacement & Least Recently Used page replacement algorithms. All frames are initially empty, b) What is compaction? Module -5 a) Describe any four schemes for defining the logical structure of directory. b) What are the different file access methods? Page 3 of 4 1011001T 303122103 ) 20 a) Whatare the different file allocation methods? e b) Explain FCFS, SSTF and SCAN disk scheduling algorithms, using the given 8 disk queue of requests: 82,170,43,140,24,16,190. Find the total cylinder wéfent for each case, Assume that, the disk has 200 cylinders ranging from (0 to 199 and the current position of head is at cylinder 50 and disk is moving 1S forward direction. ee MONOLE- 4