# GATE2010-21,ISRO2017-60

4.6k views

The cyclomatic complexity of each of the modules A and B shown below is 10. What is the cyclomatic complexity of the sequential integration shown on the right hand side?

1. 19
2. 21
3. 20
4. 10

retagged

Cyclomatic Complexity of module = Number of decision points + 1

Number of decision points in A = 10 - 1 = 9
Number of decision points in B = 10 - 1 = 9
Cyclomatic Complexity of the integration = Number of decision points + 1
= (9 + 9) + 1
= 19

selected

Cyclomatic complexity of A=B=10

Number of decision points in A = 10 ­-1 = 9
Number of decision points in B = 10- ­ 1 = 9
Cyclomatic Complexity of the integration = Number of decision points + 1 = (9 + 9) + 1 = 19

Answer must be A

0
is there any other way? ... @shiva veteran
1 vote
a) 19
1 vote

As we know their are several ways to find Cyclomatic complexity one of the is :

Cyclomatic complexity = Number of enclosed regions + 1

Here, +1 is because of count of external region

Therefore, Cyclomatic complexity of A is 10 (given) which means Number of enclosed regions + 1 external region

and Cyclomatic complexity of B is 10 (given) which means Number of enclosed regions + 1 external region

When we combine both the modules external region becomes same for both

Hence, 10 + 10 - 1 = 19

Option (A) is correct.

cyclometric complexcity = edges - nodes +2

i think, while joining two independent graph structures sequentially, an extra edge is appeared between them , so 10+10+1 =21

Ans A

## Related questions

1
853 views
What is the appropriate pairing of items in the two columns listing various activities encountered in a software life cycle? P. Requirements Capture 1. Module Development and Integration Q. Design 2. Domain Analysis R. Implementation 3. Structural and Behavioral Modeling S. Maintenance 4. Performance Tuning P-3 Q-2 R-4 S-1 P-2 Q-3 R-1 S-4 P-3 Q-2 R-1 S-4 P-2 Q-3 R-4 S-1