Pakistan's best MCQs practice hub — FPSC · PPSC · CSS · NTS · Other Exams
Login

If a software control flow graph has 10 edges ($E$) and 7 nodes ($N$) with 1 connected component ($P=1$), its Cyclomatic Complexity $V(G)$ is:

A3
B5
C7
D12

Explanation

Using McCabe’s formula $V(G) = E – N + 2P = 10 – 7 + 2(1) = 5$.

Exam Relevance
  • Topic: Software Metrics
  • Subtopic: McCabe Formula
Submitted by: mcqstutor Team More Software Engineering MCQs →

No Comments

Leave a comment

Your email address will not be published. Required fields are marked *