Software Engineering · Cyclomatic Complexity
Official IIT answer key · IIT Kanpur · Audited Aug 2026
GATE CSE 2015 Set 3 Q55 · MCQ · 2 marks

Key concept
No account needed
Sit 1 related Cyclomatic ComplexityPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
In GATE CS, Control Flow and Cyclomatic Complexity questions evaluate the student's ability to compute McCabe's Cyclomatic Complexity across multiple representations (C code snippets, explicit Control Flow Graphs, and composite/sequential modules). The core focus is on applying graph-theoretic and predicate-based definitions of cyclomatic complexity to measure code complexity.
Full Cyclomatic Complexity guide →Consider three software items: Program-X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program-Z as shown below The values of McCabe's Cyclomatic complexity of Program-X, Program-Y, and Program-Z respectively are
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
