Cyclomatic complexity is denoted by

M

Mr. Dubey

🎓 Coach ⭐ 103.11K Points

📊 Software Testing

Q. Cyclomatic complexity is denoted by

(A) e-n+2P
(B) Number of regions of graph
(C) No of predicate nodes + 1
(D) All of the above

💬 Discuss

✅ Correct Answer: (D) All of the above

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

877

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

91%

Success Rate