Software Testing | Week 2

1.  Which of the following best defines an infeasible test path?

c. An infeasible test path is one that cannot be executed by any test case

2. How are test requirements defined and met in graphs-based structural coverage criteria?

b. Test requirements are defined as properties of test paths and they are met by using test paths that satisfy each test requirement

3. In control flow graphs, which of the terms below represents a basic block?

a. A basic block is a sequence of statements such that there is no branching in the sequence

4. Consider a control flow graph G corresponding to a method and a strongly connected component S in C. Which of the following does S represent in the code that G corresponds to?

b. S represents a loop in the method

5. Which of the algorithms will return the shortest paths between two nodes in a control flow graph?

a. Breadth first search

6. State true or false: There are test paths that achieve node coverage but not edge coverage.

b. False

7. Which of the following test paths achieve edge coverage?

a. Test path [1, 2, 3, 2, 4].

8. State yes or no: In the graph above, the test path [1, 2, 3, 2, 4] tours the pair of edges [3, 2, 3].

b. No

9. The test paths {[1, 2, 4], [1, 2, 3, 2, 3, 2, 4]} achieve which of the following coverage criteria?

d. Edge pair coverage

10. State true or false: The test path [1, 2, 3, 2, 4] achieves edge coverage.

a.  True