Problem Statement

Banker's Algorithm Safe Sequence Validation A computer system manages 4 resource types: A, B, C, D with 13,5,7,3 instances respectively. Current allocation and maximum needs for five processes are shown below. Process Maximum Allocation P0 <7, 5, 3, 3> <0, 1, 0, 0> P1 <3, 2, 2, 1> <2, [unclear]> P2 <9, 0, 2, 2> [unclear] P3 <2, [unclear]> <2, 1, 1, 0> P4 <4, 3, 3, 2> <0, 0, 2, 0> The system is currently in a safe state. Which of the following sequences represent valid safe sequences? <P1, P3, P4, P0, P2> <P2, P4, P0, P1, P3> <P1, P2, P0, P3, P4> <P1, P3, P4, P2, P0> Linear Recurrence with Initial Values Find the closed form solution for the recurrence relation T(n) - 7T(n-1) + 12T(n-2) = 0 with initial conditions T(0) = 5 and T(1) = 19 Pick ONE option 2·3^n + 3·4^n 3·2^n + 4^n 5·3^n + 2^n none of these