Compiler-Design
December 12, 2023Question 16106 – GATE 2022
December 12, 2023Software-Engineering
Question 24 |
With respect to software testing, consider a flow graph G with one connected component. Let E be the number of edges, N be the number of nodes, and P be the number of predicate nodes of G. Consider the following four expressions:
1. E – N + P
2. E – N + 2
3. P + 2
4. P + 1
The cyclomatic complexity of G is given by
1 or 3 | |
2 or 3 | |
2 or 4 | |
1 or 4 |
Question 24 Explanation:
Note: Out of syllabus.
Correct Answer: C
Question 24 Explanation:
Note: Out of syllabus.
Subscribe
Login
0 Comments