Scribd
Upload
619 views2 pages

CS 2401 Programming Assignment Unit 6 Final

Uploaded by

Bryan Phone

The document provides instructions to draw a flowchart and graph for an algorithm, label the nodes and edges, and then calculates the cyclomatic complexity of the algorithm. It finds there are 22 edges and 19 nodes with 1 exit point in the graph. Using the formula, the cyclomatic complexity is calculated to be 5, and the volume logic index is calculated to be 6.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt

CS 2401 Programming Assignment Unit 6 Final

Uploaded by

Bryan Phone
619 views2 pages
The document provides instructions to draw a flowchart and graph for an algorithm, label the nodes and edges, and then calculates the cyclomatic complexity of the algorithm. It finds there are 22 edges and 19 nodes with 1 exit point in the graph. Using the formula, the cyclomatic complexity is calculated to be 5, and the volume logic index is calculated to be 6.

Original Description:

CS 2401 Programming Assignment Unit 6

Copyright

© © All Rights Reserved

Available Formats

DOCX, PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

The document provides instructions to draw a flowchart and graph for an algorithm, label the nodes and edges, and then calculates the cyclomatic complexity of the algorithm. It finds there are 22 edges and 19 nodes with 1 exit point in the graph. Using the formula, the cyclomatic complexity is calculated to be 5, and the volume logic index is calculated to be 6.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
619 views2 pages

CS 2401 Programming Assignment Unit 6 Final

Uploaded by

Bryan Phone
The document provides instructions to draw a flowchart and graph for an algorithm, label the nodes and edges, and then calculates the cyclomatic complexity of the algorithm. It finds there are 22 edges and 19 nodes with 1 exit point in the graph. Using the formula, the cyclomatic complexity is calculated to be 5, and the volume logic index is calculated to be 6.

Copyright:

© All Rights Reserved
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 2

Q1) Draw the flowchart of the above algorithm

Q2) . Draw the corresponding graph and label the nodes as n1, n2, … and edges as e1,
e2,…

Q3) Calculate the cyclomatic complexity of the above algorithm


By using the formula, Cyclomatic complexity => E – N + 2*P
Edges (E) = 22
Nodes (N) = 19
Exit Point (P) = 1
 22 – 19 + (2 * 1)
3+2
 5 (no. of closed regions)
VLI (G) = no. of closed regions + 1
Hence, VLI (G) = 5 + 1 = 6

You might also like