A system has n resources R₀,.....,R_n-1, and k processes P₀,.....,P_k-1. The implementation of the resource request logic of each process P_i, is as follows:

if (i%2==0) {
  if (i < n) request Ri;
  if (i+2 < n) request Ri+2 ;
}
else {
  if (i < n) request Rn-i;
  if (i+2 < n) request Rn-i-2;
}

In which one of the following situations is a deadlock possible?

Which languages necessarily need heap allocation in the runtime environment?

What does the following program print?

#include < stdio.h >
void f (int *p, int *q) {
     p = q;
    *p = 2;
}
int i = 0, j = 1;
int main ( ){
     f(&i, &j);
     printf ("%d %d \ n", i, j);
     return 0;
}

The Cyclomatic complexity of each of the module $$A$$ & $$B$$ shown below is $$10.$$ What is the cyclomatic complexity of the sequential integration show on the right hand side?