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
2.1 Let N be the size of a sequence s of integers. Assume that an
element of s can be any one of v distinct values. Show that the
number of possible sequences is
N
i=0
v
i
.
2.2 An equivalence relation R on set S is reflexive, symmetric, and
transitive. Also, R partitions S into equivalence classes. Show that
each of the relations defined in Exercises 2.3 and 2.4 is an
equivalence relation.
2.3 Derive equivalence classes for the input variables listed below.
1. int pen_inventory; Current inventory level of writing pens.
2. string planet_name; Planet name.
3. operating system={“OS X”, “Windows XP”,
“Windows 2000”, “Unix”, “Linux”,
“Xinu”, “VxWorks”};
;Name of an operating system.
4. printer_class=set printer_ name; Set of printer names.
printer_class ...
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