Question#4

Read the code carefully and perform the following tasks:

1. Draw Control Flow Graph for the given code
2. Highlight all regions in the flow graph separately
3. Using cyclomatic complexity formula, calculate number of basis path tests.

Show path of each basis path test separately.

while(x<100)

{

if(a[x]%2==0)

{ parity=0; }

else

{ parity=1; }

switch(parity)

{ case 0:

cout<

case1:

cout<

default:

cout<

}

x++;

} p=true;