Question 2946 – Communication
April 24, 2024Question 2949 – Communication
April 24, 2024Software-Engineering
| Question 39 |
<consider the="" following="" statements="" about="" cyclomatic="" complexity="" of="" control="" flow="" graph="" a="" program="" module.="" which="" these="" are="" true?=""
- I. The cyclomatic complexity of a module is equal to the maximum number of linearly independent circuits in the graph.
II. The cyclomatic complexity of a module is the number of decisions in the module plus one, where a decision is effectively any conditional statement in the module.
III. The cyclomatic complexity can also be used as a number of linearly independent paths that should be tested during path coverage testing.
| I and II | |
| II and III | |
| I and III | |
| I, II and III |
Question 39 Explanation:
Note: Out of syllabus. [Software Engineering]
Correct Answer: B
Question 39 Explanation:
Note: Out of syllabus. [Software Engineering]
Subscribe
Login
0 Comments