Week 2 Flashcards
1
Q
What are control flow graphs?
A
Graphs that can be used to understand the connections within the code
2
Q
What is a basis path?
A
An independent path through the code
3
Q
What is cyclomatic complexity?
A
A calculation that gives an indication of complexity.
Higher number = more complex code
4
Q
How do we calculate Cyclomatic Complexity?
A
Number of Edges – Number of Nodes + 2
Or
Number of condition clauses + 1
5
Q
What does Cyclomatic Complexity help us to determine?
A
The number of tests that we should have.
It should be treated as a reasonable guide
