Picture

You might also like

Download as rtf, pdf, or txt
Download as rtf, pdf, or txt
You are on page 1of 1

ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE BE.

/ B TECH, DEGREE EXAMINATIONS : APRIL / MAY 2011 REGULATIONS : 2008 FOURTH SEMESTER 080250012 - OPERATING SYSTEMS (COMMON TO CSE / IT) Time 3 Hours PART - A (20 x 2 = 40 MARKS)Give an example of an ANSWER ALL QUESTIONS 1 2. 3. 4. 5. 6. 7. 8. 9. 10. 0. 11. 12. 13. 14. Define operating systems What are the advantages of micro kernel approach to system design? 22. Define Real Time Operating System. 21. ANSWER ANY FIVE QUESTIONS PART - B Max. Marks : 100 in the following order : a. Sequentially 0.What is meant by thrashing? 1.What is meant by RAID? Mention its applications. 2.Mention the importance of swap-space management b. Randomly

application in which data in a file should be accessed

(5 x 12 = 60 MARKS)

a. Discuss the various services provided by the operating system 4 problem

State the assumptions behind the bounded buffer producer consumer b. List and discuss different modules of operating system. b. Describe the differences between long term, medium term and short 6 term scheduling
2

a. Describe the process life cycle with neat illustration.6

Define critical section and list down its three requirements. What do you mean race condition? Define deadlock. 23.

Consider the following set of processes, with the length of the CPU-burst

Define monitor, time given in What is meant by demand paging? milliseconds: Define dynamic loading and dynamic linking. What is Belady's anomaly? What is the purpose of a translation look aside buffer? Define internal fragmentation What is File Control Block? What are the two methods of implementing directory structure? 15. Process Burst Time Priority

P1 10 3 P2 1 1 P3 2 3 P4 1 4 P5 Define bit map. The processes are assumed to have arrived in the order P1, 5 2 P2, P3, P4, P5, all at time 0.

You might also like