S.K.P ENGINEERING COLLEGE Doc. No.

: CIAT II
Rev.No. : 00
Tiruvannamalai– 606 611 Date : 28.02.2015

B.E./B.TECH/M.E. DEGREE EXAMINATIONS – MARCH, 2015

CIAT – II
IV SEM CSE
CS6401-OPERATING SYSTEMS

Date: 11 .03.15
Time: 2.00 hrs Maximum: 60 marks

Answer ALL Questions

PART A (6 x 2 = 12 Marks)

1. Define address binding.

2. What is the purpose of backing store?
3. Define TLB.
4. Define demand paging.
5. List the attributes of a file.
6. Define garbage collection.

PART B (3 x 16 = 48 Marks)

7. a) Given memory partitions of 100kb, 500kb, 200kb and 600kb. Show with neat sketch how
would each of the first fit, best fit and worst fit algorithm place the process of 412kb, 317kb,
112kb and 236kb. Which algorithm is most efficient in memory allocation?
(OR)
b) What do you mean by paging? Discuss in detail about structure of page tables with example.

8. a) Write a detailed notes on various file access methods with neat sketch.
(OR)
b) Explain disk scheduling algorithms with suitable examples.

9. a) i) Explain various file allocation method with neat sketch. (8)

ii) Discuss various file directory structures with neat sketch. (8)
(OR)
b) i) Discuss the various levels in RAID. (8)
ii) Write a note on free space management in file system. (8)

Prepared by : FACULTY Approved by: HOD

NAME : D.MURALI