Question

A control flow graph has 9 edges and 7 nodes. What is its cyclomatic complexity, and what does this number represent in white-box testing?

A 4 — the minimum number of independent paths needed to achieve full branch coverage
B 2 — the maximum number of loops in the program
C 16 — the number of possible execution paths through the program
D 9 — the total number of test cases required regardless of structure
E 4 — the number of syntax errors detected in static analysis
Practice Next

Hey! Ask a query

🎓
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
  • 200 Questions with Detailed Solutions
  • Section-wise Coverage (GA, English, Quant & Reasoning)