Software-testing
August 26, 2024Software-testing
| Question 24 |
The graph theoretic concept will be useful in software testing is
| Cyclomatic number | |
| Hamiltonian Circuit | |
| Eulerian cycle | |
| None of these |
Question 24 Explanation:
● Cyclomatic complexity is a software metric used to indicate the complexity of a program.
● It is a quantitative measure of the number of linearly independent paths through a program’s source code.
● Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command.
● Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program
● It is a quantitative measure of the number of linearly independent paths through a program’s source code.
● Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command.
● Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program
Correct Answer: A
Question 24 Explanation:
● Cyclomatic complexity is a software metric used to indicate the complexity of a program.
● It is a quantitative measure of the number of linearly independent paths through a program’s source code.
● Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command.
● Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program
● It is a quantitative measure of the number of linearly independent paths through a program’s source code.
● Cyclomatic complexity is computed using the control flow graph of the program: the nodes of the graph correspond to indivisible groups of commands of a program, and a directed edge connects two nodes if the second command might be executed immediately after the first command.
● Cyclomatic complexity may also be applied to individual functions, modules, methods or classes within a program
Subscribe
Login
0 Comments