With respect to software testing, consider a flow graph G with one connected…

PYQ GATE 2006

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:

I. E - N + P
II. E - N + 2
III. P + 2
IV. P + 1

The cyclomatic complexity of G is given by:

  1. A.

    I or III

  2. B.

    II or III

  3. C.

    II or IV

  4. D.

    I or IV

Attempted by 112 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…