10/25/25, 5:02 PM Software Testing - - Unit 5 - Week 2
([Link] ([Link]
suryakantbidemani@[Link]
NPTEL ([Link] » Software Testing (course)
Course Week 2 : Assignment 2
outline The due date for submitting this assignment has passed.
Due on 2025-08-06, 23:59 IST.
About
NPTEL ()
Assignment submitted on 2025-07-28, 11:03 IST
How does an 1) Which of the following best defines an infeasible test path? 1 point
NPTEL
online An infeasible test path is one that does not exist in the graph.
course An infeasible test path is one that can be executed by a failed test case.
work? ()
An infeasible test path is one that cannot be executed by any test case.
Week 0 () An infeasible test path is one that does not start at an initial vertex or end at a final vertex.
Yes, the answer is correct.
Week 1 () Score: 1
Accepted Answers:
An infeasible test path is one that cannot be executed by any test case.
Week 2 ()
Lecture 5 - 2) How are test requirements defined and met in graphs-based structural coverage 1 point
Basics of criteria?
Graphs: As
used in Test requirements are basically the same as test paths, they are given as test paths.
testing (unit? Test requirements are defined as properties of test paths and they are met by using test
unit=23&lesso
paths that satisfy each test requirement.
n=24)
Yes, the answer is correct.
Lecture 6 - Score: 1
Structural Accepted Answers:
Graph Test requirements are defined as properties of test paths and they are met by using test paths
Coverage that satisfy each test requirement.
Criteria (unit?
unit=23&lesso
3) In control flow graphs, which of the terms below represents a basic block? 1 point
n=25)
[Link] 1/4
10/25/25, 5:02 PM Software Testing - - Unit 5 - Week 2
Lecture 7 - A basic block is a sequence of statements such that there is no branching in the
Elementary sequence.
Graph
A basic block is any sequence of statements that occurs as a path in the control flow
Algorithms
graph.
(unit?
unit=23&lesso Yes, the answer is correct.
n=26) Score: 1
Accepted Answers:
Lecture 8 - A basic block is a sequence of statements such that there is no branching in the sequence.
Elementary
Graph 4) Consider a control flow graph G corresponding to a method and a strongly 1 point
Algorithms - connected component S in C . Which of the following does S represent in the code that G
Part 2 (unit? corresponds to?
unit=23&lesso
n=27)
S represents the entire method in case the method does not have loops.
Lecture 9 -
Algorithms:
S represents a loop in the method.
Structural
Graph Yes, the answer is correct.
Coverage Score: 1
Criteria (unit? Accepted Answers:
unit=23&lesso S represents a loop in the method.
n=28)
5) Which of the algorithms will return the shortest paths between two nodes in a 1 point
Week 2
control flow graph?
Feedback
Form
:Software
Testing!!
(unit?
unit=23&lesso
n=176)
Practice:
Week 2 :
Assignment 2
(Non Graded)
(assessment?
name=233)
Quiz: Week 2
: Assignment
2
Breadth first search.
(assessment?
name=234) Depth first search.
Yes, the answer is correct.
Week 3 () Score: 1
Accepted Answers:
Week 4 () Breadth first search.
Week 5 () 6) State true or false: There are test paths that achieve node coverage but not edge 1 point
coverage.
Week 6 ()
True.
Week 7 () False.
[Link] 2/4
10/25/25, 5:02 PM Software Testing - - Unit 5 - Week 2
Yes, the answer is correct.
Week 8 () Score: 1
Accepted Answers:
Week 9 () True.
7) Which of the following test paths achieve edge coverage? 1 point
Week 10 ()
Test path [1, 2, 3, 2, 4].
Week 11 ()
Test paths [1, 2, 4] and [1, 2, 3, 2].
Both the paths above achieve edge coverage.
Week 12 ()
None of the above two paths achieve edge coverage.
Learning Yes, the answer is correct.
Materials () Score: 1
Accepted Answers:
DOWNLOAD Test path [1, 2, 3, 2, 4].
VIDEOS ()
8) State yes or no: In the graph above, the test path [1, 2, 3, 2, 4] tours the pair of 1 point
Text edges [3, 2, 3].
Transcripts
() Yes.
No.
Yes, the answer is correct.
Score: 1
Accepted Answers:
No.
9) The test paths {[1, 2, 4], [1, 2, 3, 2, 3, 2, 4]} achieve which of the following coverage 1 point
criteria?
Node coverage only.
Edge coverage only.
Node and edge coverage only.
Edge pair coverage
Yes, the answer is correct.
Score: 1
Accepted Answers:
Edge pair coverage
10) State true or false: The test path [1, 2, 3, 2, 4] achieves edge coverage. 1 point
True.
False.
Yes, the answer is correct.
Score: 1
Accepted Answers:
True.
[Link] 3/4
10/25/25, 5:02 PM Software Testing - - Unit 5 - Week 2
[Link] 4/4