ISRO CS-2023
August 29, 2024ISRO CS-2023
August 29, 2024ISRO CS-2023
| Question 61 |
McCabe’s cyclomatie complexity number of a program control graph ‘G’ with e edges, n nodes and p disconnected paths is defined as
| n-e+2p | |
| e-n+2+p
| |
| e – n + 2p | |
| n-e+p |
Correct Answer: C
Subscribe
Login
0 Comments