Skip to Main Content
Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
book

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

by Aditya P. Mathur
May 2024
Intermediate to advanced content levelIntermediate to advanced
765 pages
21h 57m
English
Pearson India
Content preview from Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
EXERCISES
EXERCISES
6.1 Consider the following often found statement in research
publications: “Complete testing is not possible.” What
completeness criterion forms the basis of this statement? In light
of the completeness criteria discussed in this chapter, is this
statement correct?
6.2 Enumerate all paths in Program P6.5. Assume that each loop is
required to be traversed zero times and once.
6.3 Why did we decide to input all tests in T during a single execution
of Program P6.5? Will the error be revealed if we were to input
each test in a separate execution ?
6.4 Draw the CFG for Program P6.5. Enumerate all paths through
this program that traverse the ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Effective Software Testing, Video Edition

Effective Software Testing, Video Edition

Mauricio Aniche

Publisher Resources

ISBN: 9781299486720