The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0=1, S1=0, S2=0. How many times will process P0 print '0'?

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?