€5/B.TECH(N)/ODD/SEM-5/5507/2024-2025/1009 ss MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL Paper Code : PCC. css02/ecc-cssoz/Pcccss02/PCCCs503/PCCCSDSO3 Operating Systems PID : 00s507 Time Allotted : 3 Hours Full Marks :70 The Figures in the margin indicate full marks. Candidate ore required to give their answers in their own words as far as practicable Group-A (Very Short Answer Type Question) 4: Arsey any ten of he folowing: [1x10 10] ae aging is related to what type of memory? ma. is a real time operating system, . WE a Process is of 128 KB and we have 247 Ke, 15 KB, 352 KB, 293 KB and 142 KB holes in memory, then worst it fill place it in’ ed i What are the conditions that must be satisfied to solve the critical section problem? o4 in paging, the logical partition of the Memory is called Which mapping Is used by TLB? ‘The segment of code in which the process may change common variables, update tables, write into files is known as (Vi) In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the rity of which process state? (9 Which field in page table can be used to reduce overhead incurred in page fault with replacement? 0 Suppose in demand paging a process demands its page 6 but, itis not loaded, and all its allocated memory frames are already used by it, then what kind of solution can we have? 0% In a6-bit system implementing Segmentation with Paging, if page size is set to 2KB, and maximum 4 segments is allowed per process, how many page tables per process and how many entries per page table? 1) A procedure defined within a can access only those variables declared locally within the and its formal parameters. Group-8 (Short Answer Type Question) Answer ony three of the following : [5x3=35] 2X What isa thread? Define user level thread (ULT) and kernel level thread (KLT) (51 DEX Compare ready queue and waiting queue. Do all processes in ready queue get into waiting queue? If yes, 6) explain your answer If no, why not M&M Briefly explain the role of Semaphore in critical section problem. 5] 5. In Contiguous Memory Allocation what two fields are necessary for memory management in the PCB of a (s] process? Suppose in a system following Contiguous Memory Allocation memory is free from 4262. A process P3 pf size 4.2KB is submitted to OS. If the process is loaded onto memory, then what will be vales of the memory management fields in the PCB of process P3. Discuss the mapping of a CPU generated Logical Address (e.g. 526) to Physical Address in case of using Execution Time Address Binding, 6. What is Demand paging and how does it relate to the concept of virtual memory? What fs the sigificance 6) of Dirty Bit in page table? Group-C (Long Answer Type Question) Answer any three of the following : (5x3 7. (a) Acomputer system has a 36-bit virtual address space with a page size of 8K and 4 bytes per page table entry. How many pages are in the virtual address space? (b) What is the maximum size of addressable physical memory in this system? a) (c) If the average process size is 8GB, would you use a one-level, two-level or three-level page table? (21 Why? (a) Ina 32-bit machine we subdivide the virtual address into 4 pieces as follows: (21 B-bit, 4-bit, 8-bit, 12-bitWe use a 3-level page table, such that the first 8 bits are for the first level and so on. Physical addresses are 44 bits and there are 4 protection bits per page. Answer the following questions: Showing all the steps you take to reach the answer. A simple number will not receive any credit. What is the page size in such a system? Explain your answer (2 number without justification will not get any credit). (e) How much memory is consumed by the page table and wasted by internal fragmentation for a [s] process that has 64K of memory starting at address 0? +8. (a) Explain Seek Time and Latency Time. a1 (b) What is the purpose of system call? 13] (3) (c) Mention one characteristic of Time Sharing System and Batch Processing System with one example. (d) Suppose a Disk Drive has 300 Cylinders numbered 0-299, The current head position of the Drive is 13] 90. The queue for the pending request in FIFO order is 36, 79, 25, 120, 194, 270, 89/ 170. Calculate the total distances in cylinders the Disk Arm moves to satisfy all the requests for the following algorithms: SSTE, (e) Suppose a Disk Drive has 300 Cylinders numbered 0-299. The current head position of the Drive is 13] 90.The queue of the pending request in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the total distances in cylinders the Disk Arm moves to satisfy all the requests for the following algorithms: C-SCAN. «9. (a) What is Readers-Writers problem? 5) (fb) How can it can be solved by Semaphore? Explain with the algorithm. the! 10 10. (a) Suppose in a 16 bit operating system following Paging with 4KB page size, A process PS of size 14.6 KB is submitted, Suppose the following frames in Memory are Free 3, 7, 9, 10. Considering the above scenario answer the following questions: : Explain the logical to physical address translation using a detailed schematic diagram, Showing the PCB (with PID related memory management fields), Page Table (fields, entries and values after allocation), Memory (showing frames and allocations) and related CPU registers. (b) What is the amount of internal fragmentation for this process? (1) (c) If PS generates a logical address 2/1254 in CPU what will be the address translated Physical (4) Sete eee near a Resources s 17‘! Process | Allocation Max Total J aare| Ale[c|o/A;B|C/D|A]B| CID e"os5] rv ]1/0/1] 2/31/41] 3| 8 | 45 | 18 [47 were ez _[2]213/2121 4141414 [is [a [re rf PB 1/2/3f4/7[9/5{6]n [uy fa [ee vygera [2;3[s[af2[4[7[ sali [tes lo, 24 ps [23/3 [2[3[ef4lsful nlols |, ave Calculate the available matrix. \ s 3.3 as BOW yy (b) If the request gets granted, What will be the safe sequence? (6) Consider the Resource Allocation State, Will the resource request by P2 for 1 instances of B and 1 instances of C and 2 instances of D ie, if Rea[P2{ = (0,1,1,2) ) arrives to the System, Determine ¥ Whether the request will be granted or not using the Pseudo allocation state and Banker’s Algorithm ¢ \?. \ 2% be granted (will it lead to a Safe state)? ane oO (d) Calculate the need matrix. DC . ae a ALS