GATE | IT | 2006 | Discrete Mathematics | Graph Theory | Question 17

Last Updated :
Discuss
Comments
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

I or III

II or III

II or IV

I or IV

This question is part of this quiz :

GATE IT 2006
Tags:
GATE
GATE CS
Discrete Mathematics
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy