Software Testing | Week 2 | Assignment 2
- Get link
- X
- Other Apps
1 point
Which of the following best defines an infeasible test path?
1 point
How are test requirements defined and met in graphs-based structural coverage criteria?
1 point
In control flow graphs, which of the terms below represents a basic block?
1 point
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?
1 point
Which of the algorithms will return the shortest paths between two nodes in a control flow graph?
1 point
State true or false: There are test paths that achieve node coverage but not edge coverage.
1 point
Which of the following test paths achieve edge coverage?
1 point
State yes or no: In the graph above, the test path [1, 2, 3, 2, 4] tours the pair of edges [3, 2, 3].
1 point
The test paths {[1, 2, 4], [1, 2, 3, 2, 3, 2, 4]} achieve which of the following coverage criteria?
1 point
State true or false: The test path [1, 2, 3, 2, 4] achieves edge coverage.
- Get link
- X
- Other Apps
Comments
Post a Comment