Question

Subject : Operating System

Banker's Algorithm:

            processes = {0, 1, 2, 3, 4};

            Available instances of resources

            avail = {3, 4, 2};

            Maximum R that can be allocated to processes

            maxm[][R] = {{7, 5, 3},

                                                {3, 2, 2},

                                                {9, 0, 2},

                                                {2, 2, 1},

                                                {4, 3, 3}};

            Resources allocated to processes

            allot[][R] = {{0, 1, 0},

                                                {2, 0, 0},

                                                {3, 0, 2},

                                                {2, 1, 2},

                                                {0, 0, 2}};

            Check system is in safe state or not

            isSafe(processes, avail, maxm, allot);

（1）Is this a safe state? If it is a safe state, give a safe sequence.

Answer 1

Need = Max - Allocation

Need = w N لیا تم

It is safe

Safe sequence is 1, 3, 0, 2 and 4

Please up vote