SOFTWARE TESTING
TEST PLAN AND TEST CASE DEVELOPMENT
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Number of independent paths
|
|
|
Number of paths
|
|
|
Number of edges
|
|
|
Number of requirements
|
Detailed explanation-1: -The cyclomatic complexity of a flow graph is the number of independent pathways present. This is because the cyclomatic complexity is used as an upper limit for the number of tests that should be run to ensure that all of the program’s statements have been run at least once.
Detailed explanation-2: -Cyclomatic complexity is a measurement developed by Thomas McCabe to determine the stability and level of confidence in a program. It measures the number of linearly-independent paths through a program module. Programs with lower Cyclomatic complexity are easier to understand and less risky to modify.
Detailed explanation-3: -Independent Paths = Edges – Nodes + 2. Independent Paths = Regions + 1. Independent Paths = Decisions + 1. 11-Jun-2014