Question Paper Code : 90071 B.E/B.Tech. DEGREE EXAMINATIONS, APRIL/MAY 2025, Fourth Semester Computer Science and Design AL 8452 — OPERATING SYSTEMS (Common to: Computer Science and Engineering (Artificial Intelligence and Machine Learning)/Computer and Communication Engineering/Artificial Intelligence and Data Science/Computer Science and Business Systems) (Regulations 2021) Time : Three hours Maximum : 100 marks Answer ALL questions. PART A — (10 x 2 = 20 marks) 1. OS is designed in different ways. In what ways modular kernel approach is similar to the layered approach? In what way they differ? 2. Under what circumstances would a user be better off using a time sharing system rather than a PC or a single — user workstation? 3. What is suspended state? List the reasons for suspending the process. 4, — How process differs from threads? 5. _ Differentiate internal and external fragmentation. 6. Consider a logical address space of 8 pages of 1024 words mapped into memory "of 32 frames. (a) How many bits are there in the logical address? (b) How many bits are there in physical address? What type of file organization is used for the following situations with respect to efficient usage of CPU time? (a) Update the records one by one ccess tl tly by key b) Access the record direc ci lerits ofthese) tynesiob ale organization,10. M. 12, 13, Why is the average search time to find a record in a file is less for an indexed sequential file than for a sequential file? What do you mean by virtualization? Compare the features of Android and iOS. PART B— (6 x 13 5 marks) (a) What you do mean by System calls? How operating system makes use of these system calls? Simple system calls (eg: getpid) are generally invoked. What is sequence of steps involved in providing the result, from the point of calling the function in the C library to the point where that function returns? Or (b) Describe in detail the four generations of computing and how operating systems developed as a result, (a) (i) Explain the state transitions of the process in 7-state model. (8) (i) What is the state of process in the following situations? Explain them in detail. ©) (1) Process ID is created (2) Fopen is executed (8) Load A instruction is executed and the page containing A is not found in the main memory. (4) The process creation cannot be denied by the OS, but there is no space to create process in the main memory (8) The process is waiting for file to open, meanwhile the OS executed medium-term scheduler Or (b) Explain the types of threads. If a thread is blocked, what happen to the process and other threads? Explain your answer by considering the scenario for all types of threads. (a) (i A process has four page frames allocated to it. The time of the last loading of a page into page frame, the time of last access to the page in each page frame, virtual page # in each page frame, R-bit and Mbit from each page frame are shown Virtual page # Page frame ‘Time loaded Time referenced Rbit Mbit 2 0 60 161 0 1 1 1 130 160 o 0 0 2] 26 162 1 9 3 3 20 163 1 1 2 90071‘A page fault occurred for virtual page 4 Which page will be selected as victim page using (1) FIFO (2) LRU (3) Clock (7) (ii) Consider the following page reference string: 4, 0, 0,0, 2, 4, 2, 1, 9, 3,2 How feing pone faulte would ooetirE phe residenttiess S79 Busing LRU stack and counter algorithm? (6) Or ) @ Consider the following memory snapshot: (6) 100 K | Process 500 K | Process 200 K | Process | 300K Process | 600 K Free A Free B Free c Free D Free Tu which partition the process 216k, 450k, 200k and 500k are allocated using Fixed partition unequal sized using single queue Fixed partition unequal sized using separate queue Dynamic partition using first-fit, best-fit, next-fit, worst-fit and quick-fit (i) _ Explain segmentation in detail: @ 14. (@ Explain about the directory structure and the record blocking. Or (b) If the request sequence is 98. 183, 122, 14, 124, 65, 67 and the current servicing is at cylinder 53. Explain about, the number of disk movements using FIFO, SSTF, SCAN, C-LOOK algorithms. 15. (@ Discuss in detail various types of virtual machines and its implementation. Or (©) Discuss in detail the features of mobile OS — i0S and Android with respect to process and memory management: PART C — (1x 15 = 15 marks) 16, (a) Illustrate the difference between deadlock starvation and race condition using a simple scenario? A resource allocation system that uses the Banker's algorithm for 3 resource types (A, B, C) and 6 users (PO, Pi, P2, Pa, PA) is currently in the following state, ‘Alloc: resources held by each user. Max: max need of each user. Reg: ongoing request of each user. ‘Avail: free resources. 3 90071