ase er err “he array need. Cl heck the state of the system. If a request from usin Pp, arrives for (0,4, 2+ 0) can the request be immediately granted. (See Unit-1V, Page 235, Prob.3) , explain about various disk space allocation methods with suitable example. b (See Unit-V, Page 250,Q.11) four of the following questions ~ ss control block ? What are the various elements of PCB? (See Unit-II, Page 84, Q.25) proces nswet any (a) What is proce: Describe following allocation algorithms — (i) Best fit (ii) First fit (ii) Worst fit. () (See Unit-IIl, Page 132, Q5) (c) Write a brief note on monitors and messages. (See Unit-IV, Page 215, Q.39) (a) Write a brief note on directory system. (See Unit-V, Page 242, Q3) (e) What are feedback loops i a (f) Why performance monitoring and evaluation file systems ? are needed in distributed *e ) Note : (i) Attempt any five questions. (i) All questions carry equal marks. 1. (a) ‘What are the functions of operating syste the differences between the following, mm? (See Unit-Il, Page 70, Q.5) types of operating (ii) Time sharing syste™- (See Unit-Il, Page 77, Q19) i ess and its state. (See Unit-Il, Page $2, Q.23) 2. (a) Explain what is proc’ : What julers ? Differentiate between long term, medium term - (See ‘Unit-HI, Page 937)312 Operating System and Architecture IRGpy, Moa ees Unit-II m) . (a) What is memory management ? ye (See Unit-nl, p aes Be 12 (b) Explain paging. (See Unit-1, Page end) (c) Differentiate between logical and physical address +Q.2) (See Unit-11y, P; , Pay (@) Consider the following reference string, ge 29.9.) 70120304230321201701 For a memory of three frames. How ma any pa for the following page replacement algorithms. (i) FIFO (ii) Optimal. Be faults wouy Scour (See Unit-IHt, Page 17 ie Be 173, Prob.tg) What are overlays and how they are used ? (See Unit-11, Page 135, Unit-IlL we ba (a) Explain the Concept of mutual excl sion. (See Unit: (b) What are semaphores ? a ie - a (©) What is resource allocation graph? (See Unit-1Y, Page 236, A, (4) Consider the following systems ata particular instan, Allocation | Max ] Available P | 0012 | o012 | 1530 P, 1000 | 1750 Py 1354 | 2356 P; | 0632 | 0652 P, | 0014 | 0656 Using Bankers algorithm answer the following — (i) Is the system in a safe state. (it) Ifa request from process P, arrives for (0420), can the request be immediately granted, (See Unit-IV, Page 235, Prob.3) Or Discuss any one classical problem in concurrent programming in detail. (See Unit-IV, Page 207, Q.29) Unit-IV. 4. (a) What are device controllers ? (See Unit-V, Page 268, Q.26) (b) Explain files system implementation in es etic oa0 ggBs Operating System and Architecture 308. al ‘ i i five Gantt chart ilustrating the execution of these jobs using FCFS @ RR, (quantum = , shortest job first and a Non-preemptive Priority gcheduling. algorithm. ji) Whatis the turnaround time and Waiting time of each job for each ( of the above scheduling algorithm ? UIE Unit-11 @ Explain the difference between logical and physical address, 7 (See Unit-I1, Page 123, Prob.7) (See Unit-II, Page 129, 9.2) (b) Differentiate between internal and external fragmentation, (See Unit-II1, Page 133, 9.7) (©) Why are segmentation and paging sometimes combined into one scheme ? (See Unit-II1, Page 179, 9.42) (a) Consider the following sequence of memory references from a 460 word program — 10, 11, 104, 170, 73, 309, 185, 245, 246, 434, 458, 364 (i) Give the reference string assuming page size of 100 words. (ii) Find the page fault rate for this reference string assuming 200 words of primary memory available to the program and FIFO and LRU replacement algorithm are used. (See Unit-IIl, Page 170, Prob.14) Or Consider a demand paging system, measured utilizations are CPU utilization 20% Paging drum 99.7% Other input output devices 5% Which (if any) of the following will (probably) improve CPU utilization ? (i) Get faster CPU (ii) Get bigger paging drum : (iii) Increase the degree of multiprogramming (iv) Decrease the degree of multiprogramming faster input output devices. Oe (See Unit-II, Page 144, Q.20) Unit-11l 3. (a) Explain the concept of mutual exclusion. (See Me Page 187, Q.6) ; itions for deadlock ? (b) What are the necessary conditions for et aRas oe308 Operating System and Architecture Note : (i) Answer five questions. In each Guestion part A, and D part has internal choice Drawing ete, Unit-1 1. (a) What are the functions of o erating system 2 (See Unitr, pa (b) Compare multithreading, multiprogramming an system. (c) Given an €quation to rel @) Turnaround time Gi) CPU busy time and (iii) Waiting time. Be 70, Q.5) id real time (See Unit-11, p (See Unit-I1, Page 107,0.51) (d) Differentiate between a multilevel feedba: ick scheduling algorithm and a multiqueue (foreground/background) CPU scheduling algorithm which uses round robin for the foregro und and Preemptive priority algorithm for the background. (See Unit-II, Page 102, Q.48) Or Assume you have following jobs to execute with one processor — Job Bust Time Priority 1 10 3 2 1 tl 3 2 3 4 1 4 2 5 2 ived ii Badiide The jobs are assumed to have arrived in the order 1, 2, gaOperating System and Architecture 307 3) fi , ‘ om 4 swe the following questions using, the Banker’s algorithm — P what is the content of the matrix need ? qn ene ails request from process P, arrives for (1, 0, 2) can the request pe granted immediately ? LLU m in a safe state ? (See Unit-IV, Page 238, Prob.4) Unit-1V *) piscuss the various attributes of a file. (See Unit-V, Page 256, Q.14) 2 o pescribe the approaches used in free space management. 2 (See Unit-V, Page 254,Q.12) (o Whatis DMA? Briefly discuss. (See Unit-V, Page 270, 0.28) 3 tiguous, linked and indexed disk allocation methods. i (@ Discuss con (See Unit-V, Page 250,Q.11) Or Suppose @ disk drive has 200 cylinders, numbered 0 to 199. The drive is currently serving @ request at cylinder 53 and the previous request wet at cylinder 60. The queue of pending requests in FIFO order i 124, 65, 67. Starting from the current head position, what is the total distance (in cylinders) that the disk are moves to satisfy all the pending requests for each of the following disk scheduling algorithms ~ (i) FCFS Gi) SSTF (iii) SCAN- 5 98, 183, 37, 122, 14, (See Unit-V, Page 291, Prob.2) Unit-V 5, (a) What is the relationship between threads and processes ? itoring and evaluation in brief. (b) Discuss performance monit (c) Compare windows and linux operating system. * (a) What 2 Discuss the advantages of distributed js distributed system ? systems. Or Briefly describe the following — (i) ‘Worms and viruses (ii) Threads. acca onen rine wR EES: ittsnot included insyllab™s—— IRGPV. Mo, ii) What is the waiting time of each processes for Pach of th, 2 Ee algorithm in part (i). Sem 306 Operating System and Architecture i Unit-IL (See Unit-I1, Page 126, Preis) 2. (a) Compare internal and external fragment. ation 2 (See Unit-1I, Page 133, Q.7) Paging ? (See Unit-mn, Page 143, Qi7n2 between logical physical 9,Q.2)3 (b) What is the advantages of demand () Discuss the difference address space address space. (See Unit- (A) Consider the following reference string — 70} 227013 OSE ROE MT KG, 1,7, 0,1 j How many Page faults would Occur for the following replacement algorithms, assuming 3 frames ? (i) FIFO replacement (ii) LRU Teplacement (iii) Opti and I, Page 12: Or What is the Once it detects thrashing, ‘ystem detect thrashing je Problem 2 em do to eliminate this (See Unit-mn, Page 138, Q12) Unit-11 3. (a) What is a Critical Tegion ? How to they relate to Controlling Access to Shared Tesources ? (See Unit-1y, Page 212, Q35)2 (b) What is Producer consumer Problem 2 Given an €xample of its Occurrence in Operating Systems, (See Unit-rv, Page 203, Q25)2 (c) What are four necessary Conditions that Needed for deadlock can Occur ? HIV, Page 219, Q.46) 3 phore is a blocking synchroni: iMitive, Describe how ization pri le. (See Unit they work with the aid of, Pseudo-cod, it-IV, Page 190, Q.12)7 Or hot of a System — Consider the following snaps!sshivani-2023) Operating System and Architecture 30: é MCA-201 M.C.A. t-Semester Examination, June 2014 OPERATING SYSTEM note : @) Answer five questions. In each question and D part has internal choice. (ii) All parts of each question are to be attempted at one place, (iii) All questions carry equal marks, out of which part A and B (Ma: 50 words) carry 2 marks, part C (Max. 100 words) carry 3 mark: part D (Max. 400 words) carry 7 marks, (iv) Except numericals, Derivation, Design and Drawing ete. Unit-1 1. (a) Describe the two general goal of an Operating system. part A, B, C is compulsor (See Unit-II, Page 70, Q: (b) What is a process ? What are the attributes of a process ? (See Unit-II, Page 85, Q.2 (c) What is the difference between preemptive and non-preemptiy scheduling ? (See Unit-II, Page 92, Q.33) (d) Define the essential properties of the following types of operati system — (i) Batch (ii) Real time (iii) Timer sharing (iv) Distributed. (See Unit-II, Page 76, Q.1 Or Consider the following set of processes. With the length of the CPI burst time given in milliseconds — Process Burst Time P; 10 ae 29 P; > Py Ps 12 owing — Anms a ae charts illustrating the execution of these processe: @ = 10). using FCFS, SIF and RR (4318 Operating System and Architecture IRGPV., MCA (Som, : Perating syste: , Page 86,09, KB, 300 KB ang est-fit and Wore. 2 KB and 426 Ky of memory ? (See Unit-II1, Page 157, Prob, 1g, (b) Compare multiprogramming with fixed partitions and multiprogrammin, with variable partition with diagram. (See Unit-III, Page 152,Q.27) 5. (a) What is a deadlock ? How deadlocks are detected ? Explain. (See Unit-IV, Page 222, 0.48) (b) Explain the following deadlock avoidance algorithms — (i) Banker’s algorithm (ii) Safety algorithm. (b) Explain in detail the sequence of actions taken by the oj to on next switch between processes ? (See Unit-II 4. (a) Given memory partitions of 500 KB, 100 KB, 200 600 KB (in-order) how would each of the First-fit, B fit algorithms place processes of 212 KB, 417 KB, 11 (in-order) ? Which algorithm the most efficient use (See Unit-IV, Page 228, 0.54) 6. (a) Explain typical elements of inter-process communication models ? (b) Explain the usage and structure of monitors with an example. (See Unit-IV, Page 213, Q.37) 7. (a) Explain about various issues involved in selecting appropriate disk scheduling algorithm. (See Unit-V, Page 280, Q.38) (b) List out various methods for free space management and explain them. (See Unit-V, Page 254, Q.12) 8. Write a short notes on — (a) Register Transfer (See Unit-I, Page 3, Q.1) (b) Multithreading (See Unit-I, Page 73, Q.10) (c) Swapping (See Unit-IIl, Page 130, Q.3) (d) Memory mapped terminals. (See Unit-V, Page 300, Q.50) Note: (i) Attempt any five questions. (ii) All questions carry equal marks, (iii) In case of any doubt or dispute the English version questio, should be treated as final.Operating System and Architecture 317 no2029) write ghort notes on- . i pistributed system e tH Clocks (See Unit-V, Page 299, Q.48) (i) interrupts (See Unit-I, Page 39, Q.37) ) UNIX operating system. i MCA-103 M.C.A. [-Semester (Two Year Course) Examination, Nov. 2022 OPERATING SYSTEM & ARCHITECTURE Ww Attempt any five questions. (ii) All questions carry equal marks. (iii)In case of any doubt or dispute the En: be treated as final. e format of the microinstruction Note = glish version question should and microoperations for the (See Unit-I, Page 28, Q.30) + instruction cycle consists? basic compute! ith flowchart ? (See Unit-1, Page 34, Q.33) ‘oller diagrammatically and (See Unit-l, Page 55, Q.56) el Threads and Kernel-Level (See Unit-II, Page 11 0, Q.55) eth 1. (a) Write th control memory ? (b) What are different phases 4 Explain instruction cycle wil 2. (a) Show internal configuration of a DMA contr explain how i it is working ? (b) What are the differences between User-Lev' Threads ? wing four processes represented as with the len} 3. (a) Consider the follo of CPU Using Preemptive sJF scheduling ~ (i) Draw Gantt chart : (ii) Calculate average waiting time. fe ita eo, Pa itisnot included in syllabus ge ere ee RGPV.iting System and ArCON" Sem, 316 Operal aia = following jobs to execute with 4, (a) Assume that you have the following jobs toe me Proce, VM . Priority s(high) med to have arrived in order 1, 2, 3,4 and 5 tution of these jobs. (See Unit-II, Page 114, Prob.3) | (b) What is turnaround time, waiting time and response time for each of the above scheduling algorithm. (See Unit-II, Page 114, Prob.3) 4. (a) What is preemptive CPU-scheduling ? Which scheduling is better in case of - (i) Time sharing (ii) Real time (iii) Interactive. The jobs are assu! Give a Gantt chart illustrating the exec (See Unit-II, Page 92, Q.34) (b) Explain paging and segmentation. (See Unit-III, Page 177, Q.37) 5. (a) Discuss the advantages and disadvantages of contiguous allocation memory management scheme. (See Unit-IIl, Page 136, Q.10) (b) Suppose that the moving head disk with 100 tracks numbered 0 to 99, is currently servicing a request at track 49 and just finished a request at track 90. If the queue of request in FIFO order in 86, 47, 91, 77 and 94. Compare the performance of LOOK and SCAN. (See Unit-V, Page 294, Prob.4) 6. (a) What is demand paging ? What are its disadvantages. (See Unit-II, Page 142, Q.16) (b) Consider the following page reference during a given time interval for memory consisting of 5 frames. Find page faults in LRU and optimal replacement strategy. Reference string 2, 6, 3, 7, 4, 2, 4, 8. . (See Unit-III, Page 171, Prob.1 7. (a) What is Bankers algorithm ? What are the weakness of Banke algorithin? (See Unit-IV, Page 231, Q.56 (b) What is critical section problem ? How it is solved by semaphore ? “ (See Unit-IV, Page 208, Q.3: eee a| - SSE 023) Operating System and Architecture 313 ‘ what are the primary functions of clock software ? © (See Unit-V, Page 299, Q.48) suppose & head of a moving head disk with 200 tracks numbered 0 to 199, @ jscurrently serving a request at track 143 and has just finished a request at track 125, if the queue of requests is kept in FIFO order. 86, 147, 91, 177, 94, 150, 102 ‘A seek takes 6 m sec per cylinder moved. How much seek time is needed for — (i) FCFS (i) SCAN (iii) STF. (See Unit-V, Page 292, Prob.3) Or What are the essential goals of disk scheduling ? Why does SCAN have a lower variance of response times than SSTF ? (Gee Unit-V, Page 287, Q.43) Unit-V 5. (a) What are threads ? Explain. ” ’ (b) What is distributed system ? “ (€) Discuss processor allocation in distributed system. cs (4) Discuss about windows operating system in detail. ” | Or Discuss various performance evaluation techniques in distributed system. Ohh Note : (i) Attempt five questions. (ii) All questions carry equal marks. 1. Explain the following CPU scheduling algorithms ~ (i) Multilevel feedback queue scheduling _ (See Unit-Il, Page 99, Q.44) i) Pre-emptive and non pre-emptive scheduling. e. (See Unit-Il, Page 92, Q.33) aS Ta Now, according to new revised syllabus of RGB. it is not included in syllabusOperating System 2023) pe ig Sys and Architecture 311 erie MCA-201 M.C.A. 1-Semester Examination, Dee. 2016 | RGEN, OPERATING SYSTEM (i) Answer five questions. In each question part A, B, C is compulsory and D part has internal choice. (ii) All parts of each question are to be attempted at one place. (ii) Al questions carry equal marks, out of which part A and B (Max 50 words) carry 2 marks, part C (Max. 100 words) carry 3 marks, part D (Max. 400 words) carry 7 marks. (iv) Except numericals, Derivation, Design and Drawing etc. Unit-1 1. (a) What are the main functions of operating system ? (See Unit-II, Page 70, Q.5) (b) Differentiate between multitasking and multiprogramming. (See Unit-II, Page 74, Q.12) (c) What are monolithic systems ? (See Unit-Il, Page 82, Q.22) (d) What is multilevel feedback scheduling ? What advantages is there is having different quantum sizes on different levels of multilevel queuing system ? (See Unit-II, Page 100, Q.45) Or For the following job, calculate average turnaround time, waiting time and response time using — (i) Round Robin (time quantum = 1) (ii) FCFS (iii) SRTN. The jobs are assumed to have arrived in the order A, B, C, D, E at almost the same time low number in priority is the process with highest priority and jobs are processed on single processor. Note: Job Burst Time Priority A 10 ah B 1 1 € 2 3 D 1 4 E 5 2310 Operating System and Architecture Rary, Wang ee } Som, (©) What are concurrent programming ? (See Unity, py m) (4) Explain dining philosopher problem wr fi i 7 ite a monitor for Quy) philosopher problem. S0lVing 4. (See Unit-ty, Pages® dining oe ge 201,929) Consider the following snapshot of a system — Allocation [Max | Available Py —0012 | 0012 1520 P,—1000 | 1750 P,—1354 | 9356 P; —0632 | 0652 Py—0014 | 0656 Answer the following questions using the Banke; (i) What is the Content of array need ? (ii) Is the System in safe state, ii) If a Tequest from proce; be immediately granted, rs, algorithm — Ss Py arzives for (0.4.2.0) can the request (See Unit-IV, Page 235, Prob.3) Unit-IV 4. (@) Explain free space management, (See Unit-v, Page 254, Qua) (b) Write the brief about DMA, (See Unit-v, Page 270, Q.28) (©) Explain various types of clocks, (See Unit-v, Page 299, 0.49) (4) Compare the throughput of C-SCAN and SCAN, assuming a uniform distribution of requests. (See Unit-v, Page 285, Q.40) Or When the average queue length is small all the disk scheduling algorithm reduce to FCFS scheduling explain why ? (See Unit-V, Page 286, Q.42) Unit-V 5. (a) What are the threads ? Explain, e (b) What are the features of distributed systems ? . (c) Explain feed back loops. ¥ (d) Write a note of windows operating system. Or Discuss the design issues in distributed file system. bus .V., it is not included in syllal "Now, according to new revised syllabus of GP. i314 Operating System and Architecture IRGPy, MCA (1. Sen ) set of vesses with the length of the CPU- ‘ | 2. Consider the set of processes with 2 U-burst ia | in milliseconds — [Burst Time | “Prionty 3 The processes are assumed to have arrived at time 0. Draw the Gantt chart for the system using FCFs, SJF, RR and Non emptive Priority scheduling. Also calculate average turnaround time Asi average waiting time of each of those scheduling. a (See Unit-I1, Page 115, Prob.) - What is Paging ? Explain Paging Principle. How is it different from segmentation, (See Unit-mm, Page 178, Q.40) + Explain demand Paging. Consider the following Page reference String — (i) FIFO (ii) LRU (iii) OPTIMAL. (See Unit-In, Page 172, Prob.17) - State dining Philosophers Problem. Give a solution to the Problem using semaphores, (See Unit-IV, Page 199, Q.21) - Consider the following snap-short of a system Allocation Max Available ABCD/AB CDIABCD Po | 0 0S OO ihwa Se) Bis! SOR Om0 50, Po | 1 3eomed ie See dic6, Pail Oir Gees 2-1 @ 6 5 > Ps:| 0.0) 14) O65 6320 Operating System and Architecture (b) Discuss the file system with various file access modes with , example. 8. Explain the following — (a) Critical section (b) Multilevel feedback queues (c)_ Interrupts (a) Layers of the /O software. IR.GPV., MCA (1-Sem (See Unit-IV, Page 208, Qa), (See Unit-II, Page 99, Q.4, 1, Page 39, Q.3) , Page 277, Q.as,» Operating System and Architecture 319 23) wen jaguish between synchronous and asynchronous data transfer Os anisms. (See Unit-1, Page 49, 0.49) Betta data transfer between two memory devices without the iscuss i tervention of the CPU, (See Unit-I, Page 54, Q.55) Explain the process of physical address generation in £086 mw microprocessor. (See Unit-I, Page 66, Q.61) ) Consider the following set of 5 processes whose arrival time and burst time are given below — [Process [ ArrivalTime [Burst Time [Priority | 0 2 If the CPU scheduling policy is a priority, prepare a Gantt chart and calculate the average waiting time and average turnaround time. (See Unit-II, Page 113, Prob.2) 3. (a) Explain the different components and functionalities of an operating system, (See Unit-II, Page 71, Q.6) (b) Write short notes on performance evaluation of scheduling algorithms. | (See Unit-Il, Page 111, Q.56) 4. (a) Briefly explain the similarities and differences between paging and segmentation. (See Unit-Il, Page 178, Q.41) (b) Explain the need for page replacement, which is the best page replacement algorithm and why ? (See Unit-III, Page 162, Q.29) 5. (a) Explain design issues and challenges of swapping. (See Unit-IIl, Page 140, Q.14) (b) Discuss the needs for establishing inter-process communication. (See Unit-IV, Page 187, QS) 6. (a) Explain the role of semaphores to achieve mutual exclusion and process izati (See Unit-1V, Page 193, Q.14) (b) Describe the representation of a resource-allocation graph in Banker's algorithm. (See Unit-1V, Page 230, Q.55) 7. (a) Explain the following disk scheduling algorithms ~ { (i) FCPS (ii) SSTF Gili) C-SCAN (iy) C-LOOK. (See Unit-V, Page 281, Q.49)