1

65kviews

Numerical on Banker's algorithm

written 8.0 years ago by | • modified 4.4 years ago |

Process | Max | Allocation | Available |
---|---|---|---|

A, B, C, D | A, B, C, D | A, B, C, D | |

P0 | 6 0 1 2 | 4 0 0 1 | 3 2 1 1 |

P1 | 2 7 5 0 | 1 1 0 0 | |

P2 | 2 3 5 6 | 1 2 5 4 | |

P3 | 1 6 5 3 | 0 6 3 3 | |

P4 | 1 6 5 6 | 0 2 1 2 |

Using Bankerâ€™s algorithm, answer the following questions:-

- 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.

ADD COMMENT
EDIT

**1 Answer**