Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Software Testing - Unit 5 - Week 2

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

10/20/24, 4:06 PM Software Testing - - Unit 5 - Week 2

Answer Submitted.
X

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

prapti_23cse33@dtu.ac.in 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Software Testing (course)

Course Week 2: Assignment 2 (Non


outline
graded)
About NPTEL Assignment not submitted
()
Note : This assignment is only for practice purpose and it will not be counted towards the
How does an Final score
NPTEL online
course work?
() 1) When do we say that a test path p tours a path q 1 point

We say that a test path p tours a path q if q is a sub-path of p.


Week 0 ()
We say that a test path p tours a path q if p is a sub-path of q.
Week 1 () Yes, the answer is correct.
Score: 1
Week 2 () Accepted Answers:
We say that a test path p tours a path q if q is a sub-path of p.
Lecture 5 -
Basics of 2) How many requirements are there for edge pair coverage? 1 point
Graphs: As
used in testing 10 requirements.
(unit?
12 requirements.
unit=23&lesson
=24) Yes, the answer is correct.
Score: 1
Lecture 6 - Accepted Answers:
Structural 12 requirements.
Graph
Coverage
Criteria (unit?

https://onlinecourses.nptel.ac.in/noc24_cs91/unit?unit=23&assessment=201 1/3
10/20/24, 4:06 PM Software Testing - - Unit 5 - Week 2

unit=23&lesson 3) Which of the following test paths satisfy node coverage but not edge coverage on the 1 point
=25) graph?
Lecture 7 -
Test path [1, 2, 4, 6, 1, 7].
Elementary
Graph Test path [1, 2, 4, 5, 6, 1, 7].
Algorithms Test path [1, 2, 3, 2, 4, 6, 1, 7].
(unit?
Test path [1, 2, 3, 2, 4, 5, 6, 1, 7].
unit=23&lesson
=26) Yes, the answer is correct.
Score: 1
Lecture 8 - Accepted Answers:
Elementary Test path [1, 2, 3, 2, 4, 5, 6, 1, 7].
Graph
Algorithms -
4) What do the prime paths [2, 3, 2] and [3, 2, 3] together represent? 1 point
Part 2 (unit?
unit=23&lesson
They represent two ways of going around the loop between the vertices 2 and 3.
=27)
They represent more than one iteration of the loop between the vertices 2 and 3.
Lecture 9 -
Algorithms: Yes, the answer is correct.
Score: 1
Structural
Graph
Accepted Answers:
Coverage
They represent more than one iteration of the loop between the vertices 2 and 3.
Criteria (unit?
unit=23&lesson 5) Consider the simple path [3, 2, 4, 5, 6] and test path [1, 2, 3, 2, 4, 6, 1, 2, 4, 5, 6, 1, 7]. 1 point
=28) Does the test path tour the simple path directly or with a sidetrip?

Practice:
The test path tours the simple path directly.
Week 2:
Assignment 2 The test path tours the simple path with a side trip [4, 6, 1, 2, 4].
(Non graded) Yes, the answer is correct.
(assessment? Score: 1
name=201) Accepted Answers:
The test path tours the simple path with a side trip [4, 6, 1, 2, 4].
Quiz: Week 2 :
Assignment 2
(assessment?
name=214)
Check Answers and Submit

Week 2: Your score is: 5/5


Solution (unit?
unit=23&lesson
=185)

Week 2
Feedback
Form: Software
Testing (unit?
unit=23&lesson
=176)

Week 3 ()

https://onlinecourses.nptel.ac.in/noc24_cs91/unit?unit=23&assessment=201 2/3
10/20/24, 4:06 PM Software Testing - - Unit 5 - Week 2

Week 4 ()

Week 5 ()

Week 6 ()

Week 7 ()

Week 8 ()

Week 9 ()

Week 10 ()

Week 11 ()

Week 12 ()

DOWNLOAD
VIDEOS ()

Text
Transcripts ()

Live sessions
()

Books ()

https://onlinecourses.nptel.ac.in/noc24_cs91/unit?unit=23&assessment=201 3/3

You might also like