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
5.1 In Example 5.2, we state “Under this assumption, when run as
the first test, t
3
is likely to fail because the expected output will not
match the output generated by SATM
.” Under what conditions
will this statement be false ?
5.2 Given program P and test t, explain the difference between an
execution trace of P against t when recorded as (a) a sequence of
nodes traversed and (b) a set of nodes traversed. Use storage space
as a parameter in your explanation. Give one example where a
sequence is needed and a set representation will not suffice.
5.3 Draw the syntax trees in Example 5.7 not shown in Figure 5.6.
5.4 Write an algorithm that takes two syntax trees T
r
and T
r
as inputs
and returns true if they are identical and false otherwise ...
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