Generate test cases for the following code by using Basic Path Testing. void sort(int a[ ],int N) { int i,j,p,t; for(i=0;ia[p]) p=j; if(p!=i) { t=a[p]; a[p]=a[i]; a[i]=t; } } } a) Draw CFG. b) How many basic paths for the CFG? c) List the basic paths. d) Generate test cases from it.
Generate test cases for the following code by using Basic Path Testing. void sort(int a[ ],int N) { int i,j,p,t; for(i=0;ia[p]) p=j; if(p!=i) { t=a[p]; a[p]=a[i]; a[i]=t; } } } a) Draw CFG. b) How many basic paths for the CFG? c) List the basic paths. d) Generate test cases from it.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Generate test cases for the following code by using Basic Path Testing.
void sort(int a[ ],int N)
{ int i,j,p,t;
for(i=0;i<N-1;i++)
{ p=i;
for(j=i+1;j<N;j++)
if(a[j]>a[p]) p=j;
if(p!=i)
{ t=a[p]; a[p]=a[i]; a[i]=t; }
}
}
a) Draw CFG.
b) How many basic paths for the CFG?
c) List the basic paths.
d) Generate test cases from it.
Expert Solution
Step 1
answer starts from step 2
Step by step
Solved in 2 steps with 2 images
