UGC NET JRF COMPUTER SCIENCE PREVIOUS YEAR PAPER SET 51

CYCLOMATIC COMPLEXITY

• V(G) = E - N + 2

E no of flow graph edges.

N no of flow graph node.

Predicate node 

• P = V(G) - 1

Mc cabe's Cyclomatic metric 

• V(G) = E - N + P

Current failure Intensity

• initial failure intensity * [1 -  exprienced failure /  exprienced failure in infity time]