Scribd
Upload
16 views

Os 1

Uploaded by

ramhacker2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
16 views

Os 1

Uploaded by

ramhacker2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
Draw Gane chart for SIF and Round Robin (time quantum Gi) Calculate average waiting time ii) Calculate average tumaround time (OR) . Consider the following processes with CPU burst in milliseconds af ales Process [Burst ime [Priority PL] 10 [Assume lower number indicates higher priority. Using priority scheduling (pre-emptive), do the folowing (Draw Gantt chart Gi) Calculate average waiting time Gi) Calculate average turnaround time 30.8, Discuss the following memory allocation technique in detail moss @ Bint at Best fit Gi) Worst fit Gv) Next fit (or) be. Iustrate the paging technique in intl architecture with neat diagram, 31.4. Consider the following page reference string, ae 1,2,3,4, 5,3, 4,1, 6, 7,8, 7,8, 9, 7,8, 9,5,4, 54,2. Find the mumber of page fauits for LRU and FIFO’ page replacement algorithms. (oR) '. Discuss the following page replacement algorithm in detail moaa primal page replacement Most frequently used page replacement 32.a, Suppose a disk has 400 cylinders numbered 0 to 399. The driver is "= 4 currently services a request at cylinder 143 and previous request was to eylinder125. The queue of pending request in FIFO order is 86, 147, 312, 91, 177, 48, 309, 22, 175,130. Find the total cylinder movement for the following scheduling algorithms, @ sts Gi) SCAN i) CSCAN (OR) >, Discuss in detail about the following us (@ Free space management G®)_ Swap space management eetere vaeseseass B.Tech. DEGREE EXAMINATION, JUNE 2023, Fourth Semester 18CSC2053 - OPERATING SYSTEMS (er te candidates admited during the academic year 218-2019 to 2021-2022) Note: () Part shoul be answered in OMR shee within fist 40 minstes and OM shoe shouldbe handed vero hall invigiatar atthe end of 4 sinute (i) Part-B& Part-C shoul be answered in answer booklet, Time: 3 hours ‘Max. Marks: 100 PART ~ A (201~ 20 Marks) sreanct® ‘Answer ALL Questions 1, Which ofthe following is not areal time operating system? 1 (A) Vworks (B) Windows CE © RT Linux (D) Palm os 2. If process is executing in its critica section, then no other processes can ‘be executing in is ertical section. This condition is called (A) Race condition (B) Process exclusion (© Mutual exclusion () Starvation 3._A process executes the following code far (i= 0;1<1 +4) fork (); How many child processes will be created? Aa ®) an © wt (D) net 4. The time taken to switch between user and kemel nodes of exccution be 2, 7 > 1 + While the time taken to switch between nwo processes be tl. Which ofthe following is tue? @ w

You might also like