www.jntuworld.

com

Code No: R05410407

R05

Set No. 2

IV B.Tech I Semester Examinations,December 2011 OPERATING SYSTEMS Common to Bio-Medical Engineering, Electronics And Telematics, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. Prove that, among nonpreemptive scheduling algorithm, SPN provides the minimum average writing time for a batch of jobs that arrive at the same time. Assume that the scheduling must always execute a task if one is available. [16] 2. Draw and explain about Two-State process model. 3. (a) Explain the various password selection strategies. (b) Discuss about UNIX password scheme.

4. Write a solution to the Bounded-Buer Producer/Consumer problem using Messages. [16] 5. (a) Explain forward- mapped page table scheme for structuring the page table. (b) What is an inverted page table? How is it useful in structuring the page table? [8+8] 6. (a) Give an example of an application in which data in a le should be accessed sequentially, randomly. (b) Dene: B= block size, R= record size, P= size of block pointer, F= blocking factor. Give a formula for F for the three blocking methods. [6+10] 7. What are the drawbacks of Interrupt driven I/O and Programmed I/O? How they are overcome? [16] 8. What are the various Solaris Thread Synchronization Primitives? Explain briey. [16]

T N

W U

R O

D L

[16]

[8+8]

www.jntuworld.com

www.jntuworld.com

Code No: R05410407

R05

Set No. 4

IV B.Tech I Semester Examinations,December 2011 OPERATING SYSTEMS Common to Bio-Medical Engineering, Electronics And Telematics, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. What are the drawbacks of Interrupt driven I/O and Programmed I/O? How they are overcome? [16] 2. What are the various Solaris Thread Synchronization Primitives? Explain briey. [16] 3. Draw and explain about Two-State process model.

4. (a) Explain forward- mapped page table scheme for structuring the page table. (b) What is an inverted page table? How is it useful in structuring the page table? [8+8] 5. Prove that, among nonpreemptive scheduling algorithm, SPN provides the minimum average writing time for a batch of jobs that arrive at the same time. Assume that the scheduling must always execute a task if one is available. [16] 6. (a) Give an example of an application in which data in a le should be accessed sequentially, randomly. (b) Dene: B= block size, R= record size, P= size of block pointer, F= blocking factor. Give a formula for F for the three blocking methods. [6+10] 7. Write a solution to the Bounded-Buer Producer/Consumer problem using Messages. [16] 8. (a) Explain the various password selection strategies. (b) Discuss about UNIX password scheme. [8+8]

T N

W U

R O

D L

[16]

www.jntuworld.com

www.jntuworld.com

Code No: R05410407

R05

Set No. 1

IV B.Tech I Semester Examinations,December 2011 OPERATING SYSTEMS Common to Bio-Medical Engineering, Electronics And Telematics, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. What are the drawbacks of Interrupt driven I/O and Programmed I/O? How they are overcome? [16] 2. (a) Explain forward- mapped page table scheme for structuring the page table. (b) What is an inverted page table? How is it useful in structuring the page table? [8+8] 3. Draw and explain about Two-State process model.

4. Write a solution to the Bounded-Buer Producer/Consumer problem using Messages. [16] 5. (a) Give an example of an application in which data in a le should be accessed sequentially, randomly. (b) Dene: B= block size, R= record size, P= size of block pointer, F= blocking factor. Give a formula for F for the three blocking methods. [6+10] 6. What are the various Solaris Thread Synchronization Primitives? Explain briey. [16] 7. (a) Explain the various password selection strategies. (b) Discuss about UNIX password scheme. [8+8]

8. Prove that, among nonpreemptive scheduling algorithm, SPN provides the minimum average writing time for a batch of jobs that arrive at the same time. Assume that the scheduling must always execute a task if one is available. [16]

T N

W U

R O

D L

[16]

www.jntuworld.com

www.jntuworld.com

Code No: R05410407

R05

Set No. 3

IV B.Tech I Semester Examinations,December 2011 OPERATING SYSTEMS Common to Bio-Medical Engineering, Electronics And Telematics, Electronics And Communication Engineering Time: 3 hours Max Marks: 80 Answer any FIVE Questions All Questions carry equal marks

1. Write a solution to the Bounded-Buer Producer/Consumer problem using Messages. [16] 2. Draw and explain about Two-State process model.

3. (a) Give an example of an application in which data in a le should be accessed sequentially, randomly. (b) Dene: B= block size, R= record size, P= size of block pointer, F= blocking factor. Give a formula for F for the three blocking methods. [6+10] 4. (a) Explain forward- mapped page table scheme for structuring the page table. (b) What is an inverted page table? How is it useful in structuring the page table? [8+8] 5. What are the various Solaris Thread Synchronization Primitives? Explain briey. [16] 6. Prove that, among nonpreemptive scheduling algorithm, SPN provides the minimum average writing time for a batch of jobs that arrive at the same time. Assume that the scheduling must always execute a task if one is available. [16] 7. (a) Explain the various password selection strategies. (b) Discuss about UNIX password scheme. [8+8]

T N

W U

R O

D L

[16]

8. What are the drawbacks of Interrupt driven I/O and Programmed I/O? How they are overcome? [16]

www.jntuworld.com