1.

The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is:(1) P + 1(2) P – 1(3) P – 2(4) P + 2Where P is number of predicate nodes in flow graph V(G).(A) (1)(B) (2)(C) (3)(D) (4)

Answer»


Discussion

No Comment Found

Related InterviewSolutions