Operating System (Comp-231)

ASSIGNMENT-III Q1. Perform the Banker Algorithm for below problem 1. Consideringem with five process to the and the mouces bypes A.B.C. Resene type A has 7 inch 10 cance and type Chinance Suppose at time following pot of the system has been taken Process Allion Max Available R C R A R MI 0 1 5 P1 2 g 2 12 2 1 0 P3 1 2 1 2 2 2 N 0 4 i) What will be the content of need Is the system in salya how she ancet Q2. Consider the following page reference string: 74.1.2.0.3.14.1.3.0.3.1.2.0 How many page fauss would occur for the First in First out (FHIO), assuming three Q3. Consider the following page reference string 7,0,1.2.03.0.4.2.3.0.2.2.1.2 How many page faults would occur for the least recently used (L.RU/LFU). assuming three frames? Q4. Consider the following page reference string: 1, 2, 3, 4, 2, 1,5,6,2,1,3,1.4,6.3.2, 1, 2, 3.1 How many page faults would occur for the optimal replacement algorithm (ORA), frames