[ 14. Applying a set of basic path test cases based on the cyclomatic complexity

Question

[ 14. Applying a set of basic path test cases based on the cyclomatic complexity metric of a software's program flow graph, we can guarantee that: Each predicate node in the procedure's flow graph is exercised at least once Each node in a program flow graph is exercised at least once Each link in a program flow graph is exercised at least once a. b. c. d. All of the above 15. Software condition-based testing can be used to: Check the correctness of predicate nodes in a program flow graph by testing different combinational conditions of Boolean expressions in each predicate node Check each statement of a program Verify every basic path of a program flow graph All of the above None of the above a. b. c. d. e. Matching: Select the best testing technique for each type of program listed. 11.A program with infinite loop problems [ 12.A protocol-based program 13.A command-line based program 14. Code with complicated variables being defined and used I ] 5. A program with alternative copies A. Syntax-based testing method B. Data flow testing C. Mutation testing D. Basic path testing method E. State-based software testing

Explanation / Answer

4. Applying a set of basic path test cases based on the cyclomatic complexity metric (white box testing) of a software's program flow graph, we can gurantee that:-

Each predicate node in procedure's graph is exercised at least once. Each node in a program flow graph is exercised at least once. Each link in a program flow graph is exercised at least once.

All of the above is correct choice.

Matching:-

A program with infinite loop problems-----Basic path testing method

A protocol-based program-----Data Flow testing

A command-line based program-------Syntax-based testing method

Code with complicated variables being defined and used---------> State-based software testing

A program with alternative copies--------> Mutation testing

5. Software condition-based testing can be used to:

a. Check the correctness of predicate nodes in a program flow graph by testing different combinational conditions of Boolean expressions in each predicate node.

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.