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

Published by Mr. Dubey ⭐ 111.42K Points at 18-Sep-2023 04:22 pm in Software Testing

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

900

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

93%

Success Rate