0
A program's flow graph has 11 nodes and 14 edges and is one connected component. Its cyclomatic complexity V(G) is
- A3
- B4
- C6
- D5
Correct answer: D
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!