NETWORK OPERATING SYSTEM & CONFIGURATION
1. Apply Banker's Algorithm on the following allocations and resources given respectively:
|
Allocation
|
|
Process
|
R0
|
R1
|
R2
|
R3
|
|
P0
|
2
|
0
|
1
|
2
|
|
P1
|
0
|
1
|
2
|
1
|
|
P2
|
4
|
0
|
0
|
3
|
|
P3
|
1
|
2
|
1
|
0
|
|
P4
|
1
|
0
|
3
|
0
|
|
Maximum
|
|
Process
|
R0
|
R1
|
R2
|
R3
|
|
P0
|
3
|
2
|
1
|
4
|
|
P1
|
0
|
2
|
5
|
3
|
|
P2
|
5
|
1
|
0
|
5
|
|
P3
|
1
|
4
|
3
|
0
|
|
P4
|
3
|
0
|
3
|
3
|
Available =
2. The program execution of following figure is described in the text using six steps. Expand the description to show the use of MAR and MBR.
3. Page replacement algorithm decide which memory pages to page out when a page of memory needs to be allocated. And it happens when a page fault occurs and a free page cannot be used to satisfy the allocation. Based on this statement, explain what are the different page replacement algorithms available and how are they different from each other. What are the advantages and disadvantages of using those algorithms?