w11-tutorial 10

# w11-tutorial 10 - Software Development Practices S2 2009...

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

Software Development Practices S2 2009 HIT2308 Tutorial 10 in Week 11 Task 1. Apply the BlackBox Equivalence partitioning test selection technique to the brief description of question 1 in the quick quiz. You will need to supply as many tests as there are equivalence partitions. Question 1. ”Write a small fragment of code that will find the largest number in an array of numbers” Purpose Input(s) Environment (if needed) Expected output(s) To test if the software can find the largest number in a set of positive ascending numbers Numtest= [ 1,3 ,4 ,5,12]; Nil. 12 To test if the software can find the largest number in a set of positive non- order number Numtest = [ 1,12,2,4,4]; Nil. 12 In a set of positive number with 2 largest number Numtest = [1,2,5,3,10,12,11,12]; Nil. 12 In a set of negative number in ascending order Numtest = [-12,-4,-3]; Nil -3 In a set of negative number in non-order Numtest = [-12,-6,-11,-3,-8] Nil. -3 In a set of zero element Numtest = [] Nil. Error. In a set of

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 3

w11-tutorial 10 - Software Development Practices S2 2009...

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

View Full Document
Ask a homework question - tutors are online