Professional Documents
Culture Documents
PART- B (5 × 16 = 80 Marks)
(OR)
(OR)
13. 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.
14. a) i) Explain various file allocation method with neat sketch. [8]
ii) Discuss various file directory structures with neat sketch. [8]
(OR)
15. a) i) Explain system administration requirement for Linux system administrator. [8]
ii) Explain setting up a Linux multifunction server. [8]
(OR)