TTT a B.Tech’ M-Tech (Integrated) DEGREE EXAMINATION, MAY 2023 ‘Third & Fourth Semester [rns | 27. Explain the working of monitor solution with respect to dining-philosophers "9 4! problem. 21CSC202J — OPERATING SYSTEMS (or the candidates admited from he academic year 202-2023 onwards) Note: seeee “@) Part =A should be answered in OMR sheet within Hest 40 minutes and OMR sheet should be handed ‘vert hall vigor a he end of 40® minute (i) Part-Band Part-C shouldbe answered in answer booklet ‘Time: 3 Houre ‘Max. Marks: 75 PART-A 20x 1= 20Marks) ee Answer ALL Questions |, What isan operating system? (A) Interface berween the hardware (B) Collection of programs that and aplication programs manages hardware resources (©) System service provider (© tho (O)sAllof the mensones application peograms 2. CPU scheduling isthe bass of eee ‘operating (B) Larger memory sized systems systems (©) Multiprocessor systems (D) Molticore systems 3. Which of the following does not interrupt a running process? pouad (A) Adevice (B) Timer (© Scheduled job (D) Power fuiure 4, What isthe main function of the command interpreter? porn (A) To provide the interface (B) To handle the Gles in the between the APIand application operating system program fo get and execute the next (D) To use the allotted memory "user-specified command space 5. What isa process control block? ae (A) Process type variable Data stracture (©) A secondary storage section Abblock in memory 6 A single thread of control allows the process to perform teereaes (A) Only one task at atime (B) Multiple task ata time (C) Only evo task at atime {D) Multiple program execution 7. What will happen when a process terminates? teeta ‘tis removed from all queues (B) It is removed from all except the job queue (©) It’s process control block is de- (D) It's memory is released allocated Paget rousaesieseams Paget rouseeaiesems12, 14, 16. rigenuea ‘Which module gives control ofthe CPU to the process selected by the short term schedule? (@) Dispatcher (©) Schedler (B) Iaxerupe (D) Counter ‘The interval from the time of submission of a process to the time of ‘completion is tuned as (A) Waiting time (©) Sleeping time (B) Response time Boaround time Which algorithm is defined inte quant? (A) Shorestjob scheduling (B).Rowad Robin scheduling (©) Priory scheduling (©) Mutievel que scheduling ‘A deadlock avoidance algorithm dynamically examines the to ‘ensue that a circular condition can never exist. (B) Resource allocation sate (B) System storage state (C) Operating system (D) Resources All unsafe states are : (@) Deadlocks (B) Not deadlocks (©) Fatals (©) Bloas In intemal fiagmentation memory is intemal to apariion and. (A) Is being used (B) Isnetbeing used (©) Iealvays used (D) Is used when demanded Logical memory is broken into blocks ofthe same size called (B) Pages (C) Backing store (D) Cubes The is used san index into the page table. (A) Frame bit (B) Pagenumber (D) Frame offset Paging increases the____ time, (A) Sleeping. 3). Waiting (©) Execution ) Context-switehing Which principe states that programs, wers and even the system be given just enough pivleges to perform their as? (A) Principle of operating system (B) Principle of eat privilege (©) Principle of process schedaling (D) Principle of revocation For system protection, a process should access (A) Allthe resources ) Only those resources for which ithas authorization (C) Few resources but authorization (D) Extemal deviess isnot required 1. 20, ha, Da, ha. 25.4, 26, When an attempt is to make a machine or network resources unavailable to? intend users, the attack is called \)Denial-of service atack B) Slow read attack © Spoofed attack (D) Starvation attack ‘Why isi difficult to revoke capabilities? 1 (A) They are too many (B) They are not defined precisely © They are distributed throughout (D) They ae access incorrectly the system PART-B(S x8 =40 Marks) aad Answer ALL Questions Write short notes about the following processing environments ‘ (@_Single-processor systems (ii) Multiprocessor systems (ii) Distributed systems (or) ‘With neat sketch explain the handling of a user application invoking the ‘open () system cal Explain the impact of various scheduling queues in process scheduling with * ‘neat diagram, (or) With a neat sketch, explain in detail about various multithreading models. * Compare asymmetric and symmetric multiprocessing in a multi-processor scheduling. (or) Present the schematic view of a monitor and deseribe it. ‘ Explain the usage of translation look aside buffer (TB) in paging. (or) Elaborate the eauses of thrashing with an example, ‘ List out the various queries to be addressed while revoking the access rights. & (or) ustrate with an example on access matrix, ' PART—C (1x 15=15 Marks) com Answer ANY ONE Question Consider the following table of arrival time and burst time of three process. Apply pre-emptive shortest job fist scheduling algorithm to schedule the process