Question

For the given program, draw the Control Flow Graph and find its cyclomatic complexity and write all linear independent paths and derive atleast one test case for each path
int maxValue, maxCount;
for (int i = 0; i < a.length; ++i) {
int count = 0;
for (int j = 0; j < a.length; ++j) {
if (a[j] == a[i]) ++count;
}
if (count > maxCount) {
maxCount = count;
maxValue = a[i];
}
}
return maxValue;

Answer 1

Answer:

898448

Explanation: