LOYOLA COLLEGE (AUTONOMOUS), CHENNAI – 600 034 B.Sc. DEGREE EXAMINATION – COMPUTER SCIENCE
|
FIFTH SEMESTER – NOV 2006
CS 5501 – OPERATING SYSTEM
(Also equivalent to CSC 507)
Date & Time : 25-10-2006/9.00-12.00 Dept. No. Max. : 100 Marks
PART A
Answer ALL the questions (10 x 2 = 20)
1) List the two main functions of an operating system?
2) Mention the three states that a process may be in?
3) Name the four conditions for deadlock?
4) State the difference between a safe state and an unsafe state?
5) What is a dirty bit?
6) What is paging daemon?
7) Define cycle stealing?
8) What is polling or busy waiting?
9) How is the file access categorized?
10) What is called a hard link?
PART B
Answer ALL the questions (5 x 8 =40)
11) a) Discuss the system calls for directory management.
OR
- b) What are layered systems?
12 a) Explain critical region in detail
OR
- b) Discuss Banker’s algorithm for a single resource to avoid deadlock.
13) a) Explain memory management with linked list.
OR
- b) Discuss the following:
- FIFO algorithm (2)
- Second chance algorithm (2)
- Clock page algorithm (2)
- LRU (2)
14) a) Explain in detail about DMA, with a neat block diagram
OR
- b) How to bridge the gap between CPU performance and disk
performance using RAID?
15) a)List out the Unix system calls to manage the directories.
OR
- b) What are the different forms of directory system?
PART C
Answer any TWO questions (2 x 20 = 40)
16) Discuss the following in detail:
- Paging
- Page tables
- TLB
17) Discuss in detail about I/O software layers.
18) What are the implementation issues in virtual memory system?
Latest Govt Job & Exam Updates: