Cyclomatic Complexity

 

1.What does CFG of a program describe?

• Sequence of function calls

• Sequence of statements executed

• Contents of the stack

• There's nothing called CFG!

 

2.A set of paths are said to be linearly independent if

• Each of them is distinct

• No paths have a common node

• No two paths have a common node

• All the paths are pairwise distinct

 

3.According to McCabe's Cyclomatic complexity, V(G) = E - N + 2. Here, N is

• No. of statements in the program

• No. of unique operators used

• No. of nodes in the CFG

• No. of edges in the CFG