You are on page 1of 4

Code: 9A15401

II B. Tech II Semester (R09) Regular & Supplementary Examinations, April/May 2012 OPERATING SYSTEMS (Computer Science & Systems Engineering) Time: 3 hours Max Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) What are the goals of an operating system? Explain the services provided by the operating system to the user. What are the benefits and disadvantages of the each of the following? Consider both the system level and the programmer level: (a) Synchronous and asynchronous communication. (b) Automatic and explicit buffering. (c) Send by copy and send by reference. Fixed-sized and variable-sized messages. (a) (b) 4 Give an instance where the producer and consumer routines may not function correctly when executed concurrently. What are the different types of storage media? Explain. Explain in detail paging with an example. Give the paging hardware and explain page table implementation. Explain deadlock in the context of client-server environment. Discuss in detail various schemes for defining the logical structure of a directory. (a) (b) What are the different times associated with a magnetic disk? What are the different types of disks that are used in computer systems? Explain them. What is domain of protection? *****

5 6 7

Code: 9A15401

II B. Tech II Semester (R09) Regular & Supplementary Examinations, April/May 2012 OPERATING SYSTEMS (Computer Science & Systems Engineering) Time: 3 hours Max Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 (a) (b) (a) (b) (a) (b) (a) (b) Give a brief note on the operating system structure. Explain operating-system generation. What are the design options for implementing send () and receive () primitives? Explain. Explain the deterministic model for scheduling algorithm evaluation. Explain critical section problem. What is serializability? Explain in detail. Why are segmentation and paging sometimes combined into one scheme? Discuss situations under which the most frequently used page replacement algorithm generates fewer page faults than the least recently used page replacement algorithm. Also discuss under what circumstance the opposite holds. What is a deadlock? How deadlocks are detected? How to recover from deadlocks? Give a detailed note on various directory structures mentioning their advantages and disadvantages. (a) (b) Which of the disk scheduling algorithms is suitable for systems that place a heavy load on the disk? Justify your answer. Why disk scheduling algorithms should be written as a separate modules of the operating system? What are the goals and principles of protection? *****

5 6

Code: 9A15401

II B. Tech II Semester (R09) Regular & Supplementary Examinations, April/May 2012 OPERATING SYSTEMS (Computer Science & Systems Engineering) Time: 3 hours Max Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 2 Give a detailed note on special-purpose systems. (a) What are the different states a process can be in? Explain process state diagram in detail. (b) State the criteria for evaluating CPU scheduling algorithms. Also state whether the criteria is to be optimized for minimal or maximum value. (a) Solve dining-philosophers problem using monitors. (b) Give the definition of swap ( ) instruction. (a) With a neat diagram explain hardware address protection with base and limit registers. (b) What is the problem with page table? How is it solved using inverted page table? Explain. (a) What are the consequences of ignoring dead locks? (b) As an application programmer, how to write program that handle deadlocks. (c) What are the disadvantages of deadlock avoidance policy? (a) Give a detailed description of acyclic graph directories. What are the problems with such a structure? (b) What are the implications of supporting UNIX consistency semantics for shared access for those files that are stored on remote file systems? How disk is initialized during disk formatting? Why boot record is created and how boot block is created? What is protection? What is security? What is the relation between them? Briefly explain both protection and security. *****

Code: 9A15401

II B. Tech II Semester (R09) Regular & Supplementary Examinations, April/May 2012 OPERATING SYSTEMS (Computer Science & Systems Engineering) Time: 3 hours Max Marks: 70 Answer any FIVE questions All questions carry equal marks ***** 1 2 (a) (b) (a) (b) 4 (a) (b) (a) (b) (c) (a) (b) Explain the five major categories of system calls in detail. Define process. Draw the process state diagram and explain. Explain the criteria for evaluation of CPU scheduling algorithms. What are the various types of errors generated when programmers use semaphores incorrectly to solve the critical section problem? Explain Petersons solution to critical section problem. Mention the purpose of base register and limit register. What is segmentation? Explain with an example. Also give the segmentation hardware. Explain about network devices. What is the significance of clocks and timers in an operating system? Differentiate blocking and non-blocking I/O. What are the different types of files? Discuss about various file access methods in detail. How speed, reliability and cost of tertiary storage devices are computed? Explain how operating system provides security. *****

7 8