In Software Engineering, Cyclomatic Complexity measures:
AThe number of linearly independent paths through a program's source code
BThe total number of lines of source code (LOC)
CThe total execution time required by a module
DThe number of global variables used in a module
Explanation
Developed by Thomas McCabe, Cyclomatic Complexity measures control flow paths using graph theory formula $V(G) = E – N + 2P$.
Exam Relevance
- Topic: Software Metrics
- Subtopic: Complexity Metrics
No Comments