Software-Engineering
August 28, 2024Software-Engineering
August 28, 2024Software-Engineering
| Question 275 |
Which one of the following is used to compute cyclomatic complexity ?
| The number of regions – 1 | |
| E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. | |
| P – 1, where P is the number of predicate nodes in the flow graph G. | |
| P + 1, where P is the number of predicate nodes in the flow graph G. |
Question 275 Explanation:
Cyclomatic complexity uses 3 formulas
1. Number of regions + 1
2. Predicate + 1
3. Edges-Vertices+2
1. Number of regions + 1
2. Predicate + 1
3. Edges-Vertices+2
Correct Answer: D
Question 275 Explanation:
Cyclomatic complexity uses 3 formulas
1. Number of regions + 1
2. Predicate + 1
3. Edges-Vertices+2
1. Number of regions + 1
2. Predicate + 1
3. Edges-Vertices+2