search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
12 votes
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
in IS&Software Engineering
retagged by
4.6k views

5 Answers

27 votes
 
Best answer
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 by
5 votes

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.

0 votes

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

Answer:

Related questions

2 votes
1 answer
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
asked Sep 29, 2014 in IS&Software Engineering jothee 853 views
7 votes
6 answers
2
3k views
In the context of modular software design, which one of the following combinations is desirable? High cohesion and high coupling High cohesion and low coupling Low cohesion and high coupling Low cohesion and low coupling
asked Sep 28, 2014 in IS&Software Engineering jothee 3k views
4 votes
3 answers
3
1.2k views
The cyclomatic complexity of the flow graph of a program provides an upper bound for the number of tests that must be conducted to ensure that all statements have been executed at most once a lower bound for the number of tests that must be conducted to ensure that ... once a lower bound for the number of tests that must be conducted to ensure that all statements have been executed at least once
asked Oct 31, 2014 in IS&Software Engineering Ishrat Jahan 1.2k views
5 votes
1 answer
4
1.5k views
Consider the following statements about the cyclomatic complexity of the control flow graph of a program module. Which of these are TRUE? The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph. The cyclomatic complexity of ... paths that should be tested during path coverage testing. I and II II and III I and III I, II and III
asked Sep 22, 2014 in IS&Software Engineering Kathleen 1.5k views
...