Generate test cases for the following code by using basic path testing. Draw CFG. a) 1914119...

Transcribed Image Text:

Generate test cases for the following code by using basic path testing. Draw CFG. a) 1914119 c) d) int test_prime() { 1919641 } int x=1,n.i; 191964119 } How many basic paths for the CFG? List the basic paths. FCA119 Generate test cases from it. scanf("%d",&n); if(n==2) else else printf("prime"); } 1919641 if(x==0) 1964119 for(i=2;i<n;i++) ( if (n%9 { else x=0;break; continue; printf("not964119 prime"); printf("prime"); 191964119 191964119 191964119 191964119 191964119 191964119 191964119 Generate test cases for the following code by using basic path testing. Draw CFG. a) 1914119 c) d) int test_prime() { 1919641 } int x=1,n.i; 191964119 } How many basic paths for the CFG? List the basic paths. FCA119 Generate test cases from it. scanf("%d",&n); if(n==2) else else printf("prime"); } 1919641 if(x==0) 1964119 for(i=2;i<n;i++) ( if (n%9 { else x=0;break; continue; printf("not964119 prime"); printf("prime"); 191964119 191964119 191964119 191964119 191964119 191964119 191964119