Section A (Multiple Choice Type) Answer All Questions (1 X 10) Question 1 i) Anticipatory paging is a : a) Fetch Strategy b) Replacement Strategy

c) Placement Strategy d) All of the above ii) Havanders Strategies deals with : a) Deadlock Detection b) Deadloch Prevention c) Deadlock Avoidance d) Deadlock Recovery iii) The phase in which the compiler checks that each operator has operands that are permitted by the source language specification is: a) Syntax Analysis b) Semantic Analysis c) Lexical Analysis d) Error Handling iv) Page Fault Frequency (PFF) algorithm adjusts a processs _____________ a) Resident Page Set b) Working Set Size c) Page Fault count d) Address space v) Processor cannot access : a) Primary Memory c) Cache memory b) Secondary Memory d) None of the above

vi) Levels of Processing I/O Commands (from top to bottom) are : a) User level SoftwareDevice independent OS SoftwareDevice DriverInterrupt Handlers b) User level SoftwareDevice independent OS Software Device DriverInterrupt Handlers c) Interrupt HandlersDevice Driver Device independent OS Software User level Software d) None of the above vii) Complier is a : a) System Software

b) Application Software c) Both a & b d) None of the above viii) a) b) c) d) Semaphore variables are : local variables of processes a common variable stored in the address space of a process implemented by Operating System Kernel None of the above

ix) A subroutine that gets substituted in places wherever called is a : a) open subroutine b) closed subroutine c) relocatable subroutine d) replaceable subroutine x) Excessive paging active as a result of non-maintenance of proper working set is termed as: a) Page Miss b) Thrashing c) Page fault d) None of the above.

Section B (Short Answer type) Answer any three (3 X 5) Question 2 With the help of proper diagram, describe the different states of a process and the possible transitions between then. Justify whether Queue can be used for storing processes in the Blocked state. (4+1) Question 3 Justify whether the system performance will increase or decrease if the primary memory is totally replaced by Cache Memory. (5) Question 4 State the components of an I/O device. Discuss the role of each. Question 5 State the necessary conditions for a deadlock. Question 6 Discuss the functions of Operating Syatem (5) (5) (5)

Section C (Short Answer type) Answer any three (3 X 15)

Question 7 a) Discuss the various jobs of a Macro Processor, describing each of them. b) Describe disadvantages of Bankers Algorithm c) Given the following scenario (assuming multiple number of a single resource): Current Loan U1 U2 U3 1 4 5 Maximum Need 4 6 8

Available = 2 State whether the system is currently in a SAFE State or not. (6+4+5) Question 8 a) Diagrammatically represent the different phases of a compiler. Discuss the utility of Error Handler and Symbol table Analyser. (7+3) b) State the various memory management strategies (3) c) Differentiate between deadlock & starvation. (2)

Question 9 a) Discuss the Data Structure used in PASS1 and PASS 2 of an assembler. b) Given the following Wait-for Graph at an instance :

Deduce whether the system is currently in a Safe or Unsafe state. (Show all steps) If in safe state, give a sequence of allocation. c) Differentiate between Real-Time & On-Line Systems. (8+5+2) Question 10 a) the operating system will execute a file if it has a proper format. Discuss the various sections required for an (i) executable file (ii) An Archive b) Describe DMA w.r.t. Input/Output. c) Compilers are faster than interpretor Justify. (8+3+4) Question 11 a) Discuss the various types of interrupts. Write down sequence of events that occur in response to an interrupt. b) Calculate the Average Turn Around Time & Average Waiting Time for the following processes assuming Round Robin Scheduling and a time slice of two units. Process P1 P2 P3 P4 Burst Time 24 3 5 4 Arrival Time 0.25 0.0 0.5 1.0 (6+4+5) Question 12 a) Discuss the utility of CPU registers. b) Discuss the disadvantages of Least Frequently Used strategy with respect to Memory Replacement Strategies. Suggest a Remedy. c) Differentiate between Deadlock Detection and Deadlock Avoidance d) Discuss Belady Anomaly. Explain with an example using page reference in the sequence A B C D A B E A B C D E and page frames allocated to the process being three and four. (3+4+3+5)