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
Test Selection, Minimization, and Prioritization
Step 1: minCov =∅.yetToCover = 6.
Step 2: All five tests and six entities are unmarked.
Step 3: As yetToCover > 0, we execute the loop body.
Step 3.1: Among the unmarked entities 4 and 6, each contain a single
1 and hence qualify as the highest priority entities. Thus, LC ={4, 6}.
Step 3.2: Among the unmarked tests, t
2
covers entities 1 and 4, and t
4
covers entities 3 and 6. Both tests have identical benefits of 2 each in
terms of the number of entities they cover. We arbitrarily select test
t
2
. Thus s = 2.
Step 3.3: minCov ={2}. Test t
2
is marked. Entities 1 and 4 covered by
test t
2
are also marked. yetToCover = 6 2 = 4.
Step 3.1: We continue with the second iteration of the loop as
yetToCover > 0. Among
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