UGC-NET | UGC NET CS 2016 July – II | Question 44
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 + 2
Where P is number of predicate nodes in flow graph V(G).
(A) (1)
(B) (2)
(C) (3)
(D) (4)
Answer: (A)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post
Last Updated :
19 Apr, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...