Question: Draw a Control Flow Graph to compute the Cyclomatic complexity of the above program. int find-maximum(int i,int j, int k){ int max; if(i>j) then if(i>k)

Draw a Control Flow Graph to compute the Cyclomatic complexity of the above program.

int find-maximum(int i,int j, int k){

int max;

if(i>j) then

if(i>k) then max=i;

else max=k;

else if(j>k) max=j

else max=k;

return(max);

}

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!