black box->fungsionalitas system
white box->struktur internal program
a.basic path testing
-tentuken flow grph
-tentukrn kompleksitas
v(g) =E-N+2
V(g) =P+1
V(g) = banyaknya region suatu graph
3.tentukan independen suatu graph
4tentukan test caese suatu kasus uji.
I
- i =1
- while i <=5{
- printf("%d",i);
- i++;
- }
- printf("selesai")
V(G) =6-6+2=2
V(G) =1+1=2
V(G) =2
III
path I =A-D
II=A-D-C-A-D
IV
test case
pathI=i >5
pathII=i>0 dan i<=5 black box testing -equivalent partition -boundary value analylsis/limit testing -comparison testing -sample testing -robustnes testing -behavior testing -requirement testing -performance testing -endurance testing -cause effect relationtip testing
Tidak ada komentar:
Posting Komentar