Question: The cyclomatic complexity of a program can be computed directly from a PDL representation of an algorithm without drawing a program flow graph.
Answer:
MCQ: The cyclomatic complexity of a program can be computed directly from a PDL representation of an algorithm without drawing a program flow graph.