Question

For the following code segment, there are 2 data slices: Sum and Prod. Determine the following:

1. Number of data tokens in the Sum data slice

2. Number of data tokens in the Prod data slice

3. Number of glue tokens

4. Number of super glue tokens

5. Weak cohesion value

6. Strong cohesion value  

void SumProduct(int n, *Sum, *Prod);

{

int i;

*Sum = 0;

*Prod = 1;

for (i=1; i<n; i++) {

*Sum = *Sum + i;

*Prod = *Prod * i; }

}

Answer 1

Answer 1) addition of a column sum=13

Answer 2)addition of a column Prod=12

Answer 3) number of tokens that lie in more than 1 data slice which are int n, int i and for loop that contributes to a total of 7

Answer 4) number of tokens that lie in every data slice which is the same as the answer 3 as there are only 2 columns so the answer remains 7.

Answer 5) 7/18(glue tokens/total tokens)

Answer 6) 7/18(super glue tokens/total tokens)