Answer Happy

Posted: **Fri Jul 08, 2022 6:39 am**

: 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 31 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 (48.13 KiB) Viewed 31 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 1: 1 void Q1() { 2 S1; 3 if(C1) { 4 S2; 5} 6 S3; 7 1f(C2 OR C3){ 8 54; 9} 10 else{ 11 55; 12) 13 S6; 14)