Software Testing Techniques Homework 3

1.

a.This is the chart

b. initial numPrimes = 4, t1 would over the loop.

c. t = ( n = 1)

d. node coverage: TR = {1，2，3，4，5，6，7，8，9，10，11，12}

Test Paths :[1,2,3,4,5,6,3,7,8,9,2,10,11,10,12]

edge coverage:TR = {(1,2),(2,10),(10,12),(10,11),(11,10),(2,3),(3,7),(7,8),(8,9),(9,2),(7,9),(3,4),(4,5),(5,6),(4,6),(6,3)}

Test Paths :[1,2,10,11,10,12],[1,2,3,4,5,6,3,4,6,3,7,8,9,2,3,7,9,2,10,12]

prime path:{(1,2,10,12),(10,11,10),(11,10,11),(2,3,7,8,9,2),(2,3,7,9,2),(1,2,3,7,8,9),(1,2,3,7,9),(1,2,3,4,5,6),(1,2,3,4,6),(3,4,5,6,3),(3,4,6,3),(4,6,3,7,9,2),(4,6,3,7,8,9,2),(4,5,6,3,7,9,2),(4,5,6,3,7,8,9,2)}

2. prime path test