Skip to Main Content
Foundations of Software Testing: Fundamental Algorithms and Techniques
book

Foundations of Software Testing: Fundamental Algorithms and Techniques

by Aditya P. Mathur
March 2007
Intermediate to advanced content levelIntermediate to advanced
709 pages
20h 23m
English
Pearson India
Content preview from Foundations of Software Testing: Fundamental Algorithms and Techniques
EXERCISES
EXERCISES
1.1 The following statement is often encountered: “It is impossible to
test a program completely.” Discuss the context in which this
statement is true. Under what definition of completely is the
statement true? (Note: Try answering this question now and
return to it after having read Chapter 6.)
1.2 Describe at least one case in which a perceived incorrect behavior
of a product is not due to an error in the product.
1.3 How many years will it take to test max exhaustively on a
computer that takes 1 ps (=10
12
s) to input a pair of integers and
execute max?
1.4 It is required to develop a strategy to test whether a joke is
excellent, good, or poor. What strategy would you propose?
Would statistical techniques be useful in joke categoriza ...
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

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

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

Aditya P. Mathur
Fundamentals of Computer Programming and IT by Pearson

Fundamentals of Computer Programming and IT by Pearson

Ashok Namdev Kamthane, Rohit Khurana

Publisher Resources

ISBN: 9788131707951