Code: 9A05505

1
OPERATING SYSTEMS
(Common to CSE, IT & ECC)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

Time: 3 hours Answer any FIVE questions All questions carry equal marks
***** 1 (a) (b) (a) (b) (a) (b) 4 (a) (b) What are the goals of an operating system? Explain the services provided by the operating system to the user.

Max. Marks: 70

2

With the help of a queuing diagram explain the working of a medium-term scheduling. Explain FCFS algorithm with an example. What is a monitor? Give the syntax of a monitor. Explain how conditional construct provides additional synchronization mechanisms. Explain the mechanisms adopted in Solaris to control access to critical sections. With a neat diagram explain paging hardware with TLB. Explain memory management in UNIX. Why can a deadlock not be prevented easily? Discuss this with respect to the necessary conditions for deadlock, considering each of them one by one.

3

5

6

(a) (b) (a) (b) (a) (b)

What is file? What are the different types of files? What are the attributes of a file? What is their significance? Explain how the operating system transforms I/O requests to hardware operations. Discuss the problems with RAID. The separation of policy and mechanism is important for flexibility in providing protection. Comment on it. What are the two methods for association between a process and a domain?

7

8

*****

Code: 9A05505

2
OPERATING SYSTEMS
(Common to CSE, IT & ECC)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

Time: 3 hours Answer any FIVE questions All questions carry equal marks
***** 1 (a) (b)

Max. Marks: 70

Enumerate on time-shared operating system. In what ways is the modular kernel approach similar to the layered approach? In what ways does it differ from the layered approach? Explain context switching. Give a note on process creation. What are the various types of errors generated when programmers use semaphores incorrectly to solve the critical section problem? Explain Peterson’s solution to critical section problem. Explain in detail paging with an example. Give the paging hardware and explain page table implementation.

2

(a) (b) (a) (b)

3

4

5

(a)

(b) 6 7 (a) (b)

Consider the dining philosopher’s problem when the chopsticks are placed at the center of the table and any two of them could be used by philosopher. Assume that the requests for chopsticks are made one at a time. Describe a simple rule for determining whether a particular request could be satisfied without causing deadlock given the current allocation of chopsticks to philosophers. Illustrate resource allocation graph. Explain directory structure. Explain the characteristics of I/O devices. Explain about host-attached storage. What are its limitations? Explain Cambridge cap system approach for protection.

8

*****

Code: 9A05505

3
OPERATING SYSTEMS
(Common to CSE, IT & ECC)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

Time: 3 hours Answer any FIVE questions All questions carry equal marks
***** 1 (a) (b) Explain the concept of multitasking. Explain the special program used to generate a system.

Max. Marks: 70

2 3 (a) (b) 4

What are the various operations performed on a process? Explain each one in detail. With an example explain how two processes accessing two semaphores enter into deadlock state? Suggest a solution. What is serializability? Give an example of a concurrent serializable schedule. Explain paging scheme for memory management, illustrate the hardware support for paging and explain the concept of paging with an example. Explain the different strategies that operating system designers can adopt vis-à-vis the problem of deadlock. (a) (b) (a) (b) What are the different types of operations that can be performed on a directory? Compare single level directory with two level directories. What are the various kinds of performance overheads associated with servicing an interrupt? Give a note on selection of a disk scheduling algorithm. What are the ways of realizing a domain? Explain domain switching in the context of protection.

5

6

7

8

(a) (b)

*****

Code: 9A05505

4
OPERATING SYSTEMS
(Common to CSE, IT & ECC)

B.Tech III Year I Semester (R09) Regular & Supplementary Examinations December/January 2013/14

Time: 3 hours Answer any FIVE questions All questions carry equal marks
***** 1 (a) (b) (a) (b) (a) (b)

Max. Marks: 70

What are system calls? Give an example of how system calls are used. What is multitasking system? Explain the concept. Also mention its advantages. Explain how a process creates a new process. Explain multilevel queue scheduling. What is readers-writers problem? Solve the problem using semaphores. What is priority inversion? What is the solution? Explain the most common techniques for structuring the page table.

2

3

4 5 (a)

(b)

Consider a system consisting of ‘m’ resources of the same type being shared by ‘n’ processes, resources can be requested and released by processes only one at a time. Show that the system is deadlock free if the following two conditions hold: (i) The maximum need of each process is between 1 and ‘m’ resources. (ii) The sum of all needs is less than m + n. Under the normal mode of operation, what is the sequence of operations a process performs while utilizing a resource? Explain the tree structured directories along with their merits and demerits.

6 7 (a) (b)

Give a brief note on the I/O performance. Explain about host-attached storage. What are its limitations? Explain the cryptographic protocol SSL.

8

*****