HW6 - CS377 Fall 2008 Homework 6 Due Date: December 2, 2008...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS377 – Fall 2008 Homework 6 Due Date: December 2, 2008 before 12:30pm Your assignment is to demonstrate how a simple binary search routine is tested to ensure the desired test coverage criteria. Two implementations of the routine are supplied with this assignment, one in Java and the other in C++. The routine contains defects your tests should help you discover. In this case, the defects are relatively easy to spot by inspection, but you are not to manually inspect the code. You may populate the sorted sequence of integers used in your search in any way you desire. You are required to test binary search both as a white-box and a black-box module. You must perform the following: 1. As a white-box, you must devise a minimal set of test cases to ensure branch coverage of the routine. Discuss whether branch coverage testing helped you discover the defects in the routine. If so, how? If not, why do you think it did not? 2.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/16/2009 for the course CSCI 578 taught by Professor Nenadmedidovic during the Spring '08 term at USC.

Page1 / 3

HW6 - CS377 Fall 2008 Homework 6 Due Date: December 2, 2008...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online