EMERGING TRENDS IN SOFTWARE ENGINEERING
MISCELLANEOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The equation V(G)= pi +1 of cyclomatic complexity is applicable only ifevery predicate node has
|
|
two outgoing edges
|
|
|
three or more outgoing edges
|
|
|
no outgoing edges
|
|
|
none of the above
|
Explanation:
Detailed explanation-1: -Predicate node is a node that contains a condition. This node has 2 or more outgoing edges from it. In the given graph, the nodes with a condition or with 2 or more outgoing edges are – 1, (2.3), 6. Hence, there are 3 predicate nodes.
Detailed explanation-2: -It is a software metric that measures the logical complexity of the program code. It counts the number of decisions in the given program code. It measures the number of linearly independent paths through the program code.
Detailed explanation-3: -According to rule 2, the formula for Cyclomatic Complexity V(G)=e-n+2 where e is no of edges, n is no of vertices.
There is 1 question to complete.