Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE IT 2006 | Question 17

  • Last Updated : 28 Jun, 2021
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
(A) I or III
(B) II or III
(C) II or IV
(D) I or IV


Answer: (C)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!