NPTEL Software Testing Week 2 Assignment Answers 2025
1. Which of the following best defines an infeasible test path?
- An infeasible test path is one that does not exist in the graph.
- An infeasible test path is one that can be executed by a failed test case.
- An infeasible test path is one that cannot be executed by any test case.
- An infeasible test path is one that does not start at an initial vertex or end at a final vertex.
Answer : See Answers
2. How are test requirements defined and met in graphs-based structural coverage criteria?
- Test requirements are basically the same as test paths, they are given as test paths.
- Test requirements are defined as properties of test paths and they are met by using test paths that satisfy each test requirement.
Answer : See Answers
3. In control flow graphs, which of the terms below represents a basic block?
- A basic block is a sequence of statements such that there is no branching in the sequence.
- A basic block is any sequence of statements that occurs as a path in the control flow graph.
Answer : See Answers
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?
- S represents the entire method in case the method does not have loops.
- represents a loop in the method.
Answer : See Answers
5. Which of the algorithms will return the shortest paths between two nodes in a control flow graph?
- Breadth first search.
- Depth first search.
Answer : See Answers
6. State true or false: There are test paths that achieve node coverage but not edge coverage.
- True.
- False.
Answer : See Answers
7. Which of the following test paths achieve edge coverage?
- Test path [1, 2, 3, 2, 4].
- Test paths [1, 2, 4] and [1, 2, 3, 2].
- Both the paths above achieve edge coverage.
- None of the above two paths achieve edge coverage.
Answer : See Answers
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].
- Yes.
- No.
Answer : See Answers
9. The test paths {[1, 2, 4], [1, 2, 3, 2, 3, 2, 4]} achieve which of the following coverage criteria?
- Node coverage only.
- Edge coverage only.
- Node and edge coverage only.
- Edge pair coverage
Answer :
10. State true or false: The test path [1, 2, 3, 2, 4] achieves edge coverage.
True.
False.
Answer : See Answers
