Cyclomatic complexity of a program is defined as M = E − N + 2P. For a program with 15 edges, 12 nodes, and 1 connected component, M =
Asked in TPSC Junior System Engineer 2026
Answer under review: our editors are checking this question. Try the other TPSC Prelims previous year questions questions meanwhile.
More TPSC Prelims previous year questions questions
- The Function Point metric measures software size based on
- Which SDLC model is most suitable when requirements are not well-understood and are expected to evolve ?
- In a Data Flow Diagram (DFD), a rectangle (square) symbol represents
- Regression testing is performed to verify that
- Which risk analysis technique in the Spiral model orders risk factors by their potential impact ?
- In UML, which diagram is used to show the sequence of messages exchanged between objects over time ?
- The term ‘technical debt’ in software engineering refers to
- Which data structure is used in Prim’s algorithm to efficiently find the minimum weight edge ?