See "Software Testing Basics" on page 49 of 7th. English version 63 pages
A
b) Maxprimes = 4,T1 cannot check for errors, T2 an array out of bounds, making T2 easier to discover than T1.
c) t3= (n=1)
d) node overlay: tr={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}
Side overlays: tr={(2,3), (2,12), (3,4), (4,5), (5,6), (6,8), (8,5), (6,7), (7,9),
(5,9), (9,10), (10,11), (9,11), (12,13), (13,14), (14,15), (15,13), (13,16)}
Main path: tr={(1,2,3,4,5,6,8), (1,2,3,4,5,6,7,9,11), (1,2,3,4,5,6,7,9,10,11)
(1,2,12,13,14,15), (1,2,12,13,16), (1,2,3,4,5,9,10,11), (1,2,3,4,5,9,11),
(2,3,4,5,6,7,9,11,2), (2,3,4,5,6,7,9,10,11,2), (2,3,4,5,9,10,11,2), (2,3,4,5,9,11,2)
(3,4,5,6,7,9,11,2,3), (3,4,5,6,7,9,10,11,2,3), (3,4,5,9,10,11,2,3), (3,4,5,9,11,2,3)
(4,5,6,7,9,11,2,3,4), (4,5,6,7,9,10,11,2,3,4), (4,5,9,10,11,2,3,4), (4,5,9,11,2,3,4)
(5,6,8,5), (5,6,7,9,10,11,2,3,4,5), (5,6,7,9,11,2,3,4,5), (5,9,10,11,2,3,4,5)
(5,9,11,2,3,4,5), (6,8,5,6), (6,7,9,10,11,2,3,4,5,6), (6,7,9,11,2,3,4,5,6)
(7,9,10,11,2,3,4,5,6,7), (7,9,11,2,3,4,5,6,7), (8,5,6,8) (9,10,11,2,3,4,5,6,7,9)
(9,10,11,2,3,4,5,9), (9,11,2,3,4,5,6,7,9) (9,11,2,3,4,5,9), (10,11,2,3,4,5,6,7,9,10)
(10,11,2,3,4,5,9,10) (11,2,3,4,5,6,7,9,11) (11,2,3,4,5,6,7,9,10,11) (11,2,3,4,5,9,10,11)
(13,14,15,13), (14,15,13,14), (15,13,14,15)}
Software Test Job--Three