V(G)=5 Path # 1 2 3 4 5 Path 1-2-11-12-16 1-2-11-12-13-12-16 1-2-4-5-8-9-16 1-2-4-5-6-8-9-16 1-2-4-5-8-4-5-8-9-16 Legend

[answerhappygod]

V G 5 Path 1 2 3 4 5 Path 1 2 11 12 16 1 2 11 12 13 12 16 1 2 4 5 8 9 16 1 2 4 5 6 8 9 16 1 2 4 5 8 4 5 8 9 16 Legend 1 (22.71 KiB) Viewed 42 times

V G 5 Path 1 2 3 4 5 Path 1 2 11 12 16 1 2 11 12 13 12 16 1 2 4 5 8 9 16 1 2 4 5 6 8 9 16 1 2 4 5 8 4 5 8 9 16 Legend 2 (50.96 KiB) Viewed 42 times

V(G)=5 Path # 1 2 3 4 5 Path 1-2-11-12-16 1-2-11-12-13-12-16 1-2-4-5-8-9-16 1-2-4-5-6-8-9-16 1-2-4-5-8-4-5-8-9-16 Legend: T = true, F = false, X = irrelevant C1 F F T T T C2 3 X X F T F C3 X X LL F LL F T/F C4 F T/F X X X
- - Construct the basis set, that is, a set of required number of independent paths through the source code fragment. Construct a path predicate for each independent path. Problem 3: 1 void Q1() { 2 for (S1; C1; S2) { 3 while (C2 && C3) { 4 if(C4){ 5 53; 6} 7 else{ 8 if(C5) { 9 54; 10) 11) 12} 13) 14 S5; 15} I