Data structures in bankers algorithm


Q1. Illustrate the meaning of operating system? Describe the different functions of the operating system.

Q2. What are the advantages of Multithreaded Programming?

Q3. State different scheduling criteria which must be kept in mind while selecting different scheduling algorithms?

Q4. Describe the critical section problem. Give a classic Peterson’s solution to the critical section dilemma.

Q5. Consider the given system snapshot by using data structures in the Banker’s algorithm, with resources A, B, C and D and process P0 to P4:

1014_bankers algorithm.jpg

By using Banker’s algorithm, answer the given questions:

a) Illustrate the number of resources of type A, B, C and D which are present there?

b) What are the contents of the Need matrix?

c) Is the system in a safe state? Explain why?

d) If a request from process P4 arrives for the additional resources of (1, 2, 0, 0), Can the Banker’s algorithm grant the request instantly? Illustrate the new system state and other criteria.

Request for Solution File

Ask an Expert for Answer!!
Operating System: Data structures in bankers algorithm
Reference No:- TGS010460

Expected delivery within 24 Hours