b)
0)

a)

b)
0)

a)

b)

0)

a)

b)

060001T305122002

What is race condition? Explain with an example.

Differentiate between Internal Fragmentation and External Fragmentation.

Whether paging is an effective solution for these fragmentation problems?

Justify.

Explain Critical Section Problem. What are the requirements for the solution of

Critical Section Problem?

What is demand paging? What are the advantages?

What is segmentation table? Where it is used?

What are semaphores? How producer consumer problem (Bounded buffer

problem) is solved using semaphores?

Consider a paging system with the page table stored in memory.

that finding a age-table entry in the TLBs takes 2 nanoseconds, if the

entry is present).

Explain thrashing.

PO
Pl
P2
P3
P4

i) If amemory reference takes 50 nanoseconds, how long does a paged
memory reference take?
ii) If we add TLBs, and 75 percent of all page-table references are found

in the TLBs, what is the effective memory reference time? (Assume

PART C

Answer any two full questions, each carries 20 marks.
Consider the following snap shot of the system

Allocation
ABCD
2 0 0 1
3 1 2 1
2 10 3
1 3 12
1 4 3 2

Max_ Available
^ 8 © ‏م‎ A BCD
4 21 2 3 3 2 1
5 25 2
2 3 1 6
14 2 4
3 6 6 5

Answer the following questions using Banker’s algorithm.

i) How many resources of type A, B, C, D are there?

ii) What are the contents of need matrix?

iii) Find if the system is in safe state? If it is, find the safe sequence.

Explain the directory implementation using the Hash table and Linear list.

Page 2 of 3

(5)
(7)

(7)
(4)
(4)
(7)

(5)

(3)

(10)

(7)