Open In App

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

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

Article Tags :
UGC-NET
Recommended Articles
1. UGC-NET | UGC NET CS 2016 July – II | Question 11
2. UGC-NET | UGC NET CS 2016 July – II | Question 12
3. UGC-NET | UGC NET CS 2016 July – III | Question 45
4. UGC-NET | UGC NET CS 2016 July – III | Question 50
5. UGC-NET | UGC NET CS 2016 July – III | Question 52
6. UGC-NET | UGC NET CS 2016 July – III | Question 53
7. UGC-NET | UGC NET CS 2016 July – III | Question 63
8. UGC-NET | UGC NET CS 2016 July – III | Question 64
9. UGC-NET | UGC NET CS 2016 July – III | Question 65
10. UGC-NET | UGC NET CS 2016 July – II | Question 13
11. UGC-NET | UGC NET CS 2016 July – II | Question 14
12. UGC-NET | UGC NET CS 2016 July – III | Question 16
13. UGC-NET | UGC NET CS 2016 July – III | Question 24
14. UGC-NET | UGC NET CS 2016 July – III | Question 25
15. UGC-NET | UGC NET CS 2016 July – III | Question 43
16. UGC-NET | UGC NET CS 2016 July – III | Question 44
17. UGC-NET | UGC NET CS 2016 July – II | Question 1
18. UGC-NET | UGC NET CS 2016 July – II | Question 2
19. UGC-NET | UGC NET CS 2016 July – II | Question 3
20. UGC-NET | UGC NET CS 2016 July – II | Question 4
21. UGC-NET | UGC NET CS 2016 July – II | Question 5
22. UGC-NET | UGC NET CS 2016 July – II | Question 6
23. UGC-NET | UGC NET CS 2016 July – II | Question 7
24. UGC-NET | UGC NET CS 2016 July – II | Question 8
25. UGC-NET | UGC NET CS 2016 July – II | Question 9