Consider the below algorithm: for (i=1;i < n;i++){ for (j=1;j < m;j++){ Alloc[i][j]=( 2i *( j+1 ) % 7) } } For n=13 and m=6 answer the following questions What value Alloc[2][4] will store? What value Alloc[4][3] will store? What value Alloc[7][2] will store? What value Alloc[11][5] will store?
Consider the below
for (i=1;i < n;i++){
for (j=1;j < m;j++){
Alloc[i][j]=( 2i *( j+1 ) % 7)
} }
For n=13 and m=6 answer the following questions
What value Alloc[2][4] will store?
What value Alloc[4][3] will store?
What value Alloc[7][2] will store?
What value Alloc[11][5] will store?
This part of the problem involves in deriving the Allocation matrix for a set of threads for implementing Banker's algorithm. Consider the system has five threadts (T0~T4) and five resourses (A~E) [Remember all threads are in CAPITAL letter]. Currents allocation matrix follows the following rule: T0 has allocated resources equal to the value of row A[2] of Alloc[i][j] array, T1 has equal to row A[4], T2 has equal to row A[7], T3 has equal to row A[9] and T4 has equal to row A[11]. [Hints. if a row has a value 12345 then allocated resourses are A:1,B:2,and so on.]
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
