Homework2 of Software Testing
2016-03-06 15:35
106 查看
Program1:
The fault is : for(int i=x.length-1;i>0;i--)
We should change i>0 into i>=0
identify a test case that does not execute the fault:x=null
identify a test case that executes the fault, but does not result in an error state: x[3]={2,3,5} y=5
identify a test case that results in an error, but not a failure: x[3]={2,3,5} y=6
program2:
The fault is : for(int i=0;i<x.length;i++)
We should change it into for(int i=x.length-1; i>=0;i--)
identify a test case that does not execute the fault: x=null
identify a test case that executes the fault, but does not result in an error state: x[3]={2,0,5}
identify a test case that results in an error, but not a failure: x[3]={2,3,5}
The fault is : for(int i=x.length-1;i>0;i--)
We should change i>0 into i>=0
identify a test case that does not execute the fault:x=null
identify a test case that executes the fault, but does not result in an error state: x[3]={2,3,5} y=5
identify a test case that results in an error, but not a failure: x[3]={2,3,5} y=6
program2:
The fault is : for(int i=0;i<x.length;i++)
We should change it into for(int i=x.length-1; i>=0;i--)
identify a test case that does not execute the fault: x=null
identify a test case that executes the fault, but does not result in an error state: x[3]={2,0,5}
identify a test case that results in an error, but not a failure: x[3]={2,3,5}
相关文章推荐
- think in java读后总结---Map集合的几种遍历方式
- Python之常用模块(一)
- android简单实例---------ActionBar的简单使用(一)
- 边看书边做边发挥-图书软件-9
- NBUT 1665
- 构建之法阅读笔记01--泛读《构建之法》提出的问题
- 构建之法阅读笔记01
- 20道简单加减法随机生成程序
- QT5 应用1
- 文档目录与宏
- Android开发60条技术经验总结
- LeetCode--160. Intersection of Two Linked Lists
- Java编程学习小技巧
- 基于 ODR 和 BSMOTE 的不均衡 SVM 分类算法
- POJO和EJB的区别
- 集群源码安装ONOS
- [国嵌攻略][110][驱动开发概述]
- Spring4.0学习笔记--IOC
- java 类加载后不一定会对类进行初始化
- 学习进度条——第一周