16.
17.
18.

19.
20.
21.

22.

-23.

24.
25.
26.
27.
28.
29.
30.

31.

2 D 40086
Part C

Answer any five questions.
Each question carries 4 marks.

What are the different goals of an operating system ?
What are the requirements to be satisfied by a solution to the critical-section problem ? Explain.

Write the code to implement mutual exclusion condition in critical section problem using a test and
set instruction.

Differentiate between Priority scheduling algorithms and Round Robin scheduling algorithms.
Differentiate between linked allocation and indexed allocation.

Consider a logical address space of eight pages of 1024 words each mapped onto a physical memory
of 32 frames. Answer the following questions with proper explanations

(a) How many bits are in the logical address ?

(b) How many bits are in the physical address ?
Write short notes on the following page replacement algorithms :

(a) LRU replacement.
- (b) FIFO replacement.
What are the different goals of computer security and protection ?

| | (5 x 4 = 20 marks)

Part D
Answer any five questions.
Each question carries 8 marks.

Briefly discuss about the evolution of operating systems.
Explain Banker's algorithm with an example.
With necessary details, explain how communication in client server systems implemented.
Explain about various CPU scheduling algorithms with example.
Explain how producers-consumers problem is handled using semaphore.
With the help of a neat diagram explain the concept of demand paging.
Write short notes on :

(a) Swapping.

(b) Thrashing.

’ Discuss the architecture of a popular mohile operating system.

(5 x 8 = 40 marks)