Madras University (UnOM) 2005 M.Sc Computer Science operating system - Question Paper

PART A - (5 x two = 10 marks)

ans ALL ques..

All ques. carry equal marks. every ans should not exceed 50 words.

1.How do you compare CPU scheduling algorithms?

2.Define semaphore.

3.What is meant by thrashing?

4.What is the need for file protection?

5.List a few of file system commands used in UNIX.



PART B - (4 x.5 = 20 marks)

ans any 4 ques.. All ques. carry equal marks.

every ans should not exceed 250 words.



6. Compare short term, medium term, long term scheduling.

7. What is deadlock? explain the process of deadlock avoidance.

8. discuss about paging mechanism.

9. explain the various file operations in detail.

10. define any two, disk scheduling algorithms.

11.Write a note on shell programming.



PART C - (5 x 10 = 50 marks)

ans ALL ques.. All ques. carry equal marks.

every ans should not exceed 500 words.



12. (a) describe the essential properties of the subsequent kind of operating systems.

(i) Batch

(ii) Interactive

(iii)Time sharing

(iv)Real time

(v) Network.

Or

(b) (i) What is the need for an OS? explain.

(ii) explain any 2 scheduling algorithms.



13.(a)Explain the deadlock prevention mechanism.

Or

(b) (i) discuss the requirements for mutual exclusion also explain the software approach and hardware support for mutual exclusion.



(ii) discuss in detail P and V operations on counting semaphores for process synchronization.



14.(a)Explain in detail about virtual memory.

Or

(b) discuss about different kinds of disk scheduling.



15.(a) (i) explain the need for file protection. (ii) explain anyone file access methods.

Or

(b) (i) explain 1 problem of reliability in file systems consistency.

(ii) discuss the various, approaches implementing shared file and subdirectories.

16. discuss the file system of UNIX.



Or

explain in detail about memory management in DOS

Earning:   Approval pending.