The cyclomatic complexity of the following flow graph is: nodes 1, 2, 3, 4, 5, 6, 7, 9, 10 with edges 1→2, 1→10, 2→3, 2→4, 3→9, 4→5, 4→6, 5→7, 6→7, 7→9, 9→1.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. 4
Explanation
E = 11 and N = 9 (there is no node 8), so V(G) = E − N + 2 = 4. Equivalently, there are 3 decision nodes (1, 2, 4), giving 3 + 1 = 4.More Software Engineering questions
- Match List I with List IIList I List II A. Verification I. White box Testing B. Validation II. Black box Testing C. Internal logic exercise…
- Which of the following are white-box testing techniques? A. Path testing B. Loop testing C. Regression testing D. Non-functional testing Ch…
- For software quality assurance, which of the following is correct? A. Execution of code B. No execution of code C. Preventive technique D.…
- Which of the following is NOT one of the principles of good coding?
- If P is the risk probability and L is the loss, then risk exposure (RE) is computed as ______
- Which of the following is a technique used for component wrapping?