Property:More notes

inputs(invalid, int, double, constants), sign(+,-), algebra(x!,x^2,root(x))

Base on Pairwise, we count and build 9 test cases, and 1 test case by Myer's.

input1(true, false, number, invalid), input2(true, false, number, invalid),
boolean operators (AND(&), OR , EQUAL(=), NOT EQUAL(!=)),
label (valid labels, invalid, no labels)

input1(pos, neg, 0, invalid(a-z)), input2(pos, neg, 0, invalid(a-z)) ,operations(+,-,*,/)

 input1 (pos, neg, 0, invalid(a-z)), input2 (pos, neg, 0, invalid(a-z)) ,operations(+,-,*,/)

 input1 (pos, neg, 0, invalid(a-z)), input2 (pos, neg, 0, invalid(a-z)) ,operations(+,-,*,/)

We build 14 tests for this test case by pairwise.
The following is the test suite for algebra and constant test:

inputs(invalid, int, double, constants), sign(+,-), algebra(x!,x^2,root(x))

Base on Pairwise, we count and build 9 test cases, and 1 test case by Myer's. We check the constants(pi, e) and use it by putting them as input values. We just test three of algebra operations, which are x!, x^2, root(x).More tests are needed to cover the other functions of the algebra feature.
The following is the test sequence for testing boolean feature(And, Or, Equal, Not Equal) and creating label:

input1(true, false, number, invalid), input2(true, false, number, invalid),
boolean operators (AND(&), OR , EQUAL(=), NOT EQUAL(!=)),
label (valid labels, invalid, no labels)

Based on Pairwise, we use TConfig to count and produce 12 test cases. In addition, based on Myer's, we build 3 test cases for invalid inputs for the test suite.
The following is the case sequence to test the four arithmetic operations(addition, subtract, multiply, division ):

input1(pos, neg, 0, invalid(a-z)), input2(pos, neg, 0, invalid(a-z)) ,operations(+,-,*,/)

• Since these functions take two boolean inputs, it is feasable to test all possible combinations.
• A pairwise approach is used to test the 'NOT' operator at the same time: All inputs to 'NOT' are tested while testing the outer logic operators without duplication.
  Assumptions:
• All outputs are truncated to 1 decimal place.
• Mathematically invalid operations should show a #syntaxerror
• Arithmetic overflow is not likely to be a problem for the range of values required, hence is not tested.

Rationale

• Moving the turtle and then checking its Y co-ordinate is used rather than directly checking the output from the math function is done because the print function itself seems to catch errors and write '0' regardless, whereas moving the turtle reveals these errors. Furthermore, moving the turtle again after the test indicates that the program is left in a working state.
• Equivalence partitioning is used since the math functions take at most 2 inputs, and the number tests required to provide sufficient coverage is optimal.
• Addition, Subtraction, Multiplication, Division & Modulo: Values are chosen from the partition class {Negative Real Number, 0.0, Positive Real Number}
• Square Root: Values tested include {-1 (invalid), 0, 1, 4 (integer result), 7 (irrational result)}. These values were selected using Boundary Analysis.
  Rationale:
• The equivalence partitions for the 'forward' and 'back' blocks are {Negative Number, Positive Number, Large Positive Number}
• The equivalence partitions for the 'left' and 'right' blocks are {Negative Number, Positive Number < 360, Positive Number > 360}
• It is assumed that the blocks function independently, so a member from each partition is tried once against each block.
• This test sequence itself follows a simple use case: the user wants to draw a box with a dome on top.
  Rationale:
• The inputs are chosen from the equivalence partition { Negative, Zero, Positive }
• Input combinations were chosen to give a variety of outputs, for each partition. Boundary values are also tested.

• All outputs are truncated to 1 decimal place.
• Mathematically invalid operations should show a #syntaxerror
• Arithmetic overflow is not likely to be a problem for the range of values required, hence is not tested.

Rationale

• Moving the turtle and then checking its Y co-ordinate is used rather than directly checking the output from the math function is done because the print function itself seems to catch errors and write '0' regardless, whereas moving the turtle reveals these errors. Furthermore, moving the turtle again after the test indicates that the program is left in a working state.
• Equivalence partitioning is used since the math functions take at most 2 inputs, and the number tests required to provide sufficient coverage is optimal.
• Addition, Subtraction, Multiplication, Division & Modulo: Values are chosen from the partition class {Negative Real Number, 0.0, Positive Real Number}
• Square Root: Values tested include {-1 (invalid), 0, 1, 4 (integer result), 7 (irrational result)}. These values were selected using Boundary Analysis.

• The inputs are chosen from the equivalence partition { Negative, Zero, Positive }
• Input combinations were chosen to give a variety of outputs, for each partition. Boundary values are also tested.

• Since these functions take two boolean inputs, it is feasable to test all possible combinations.
• A pairwise approach is used to test the 'NOT' operator at the same time: All inputs to 'NOT' are tested while testing the outer logic operators without duplication.

• The equivalence partitions for the 'forward' and 'back' blocks are {Negative Number, Positive Number, Large Positive Number}
• The equivalence partitions for the 'left' and 'right' blocks are {Negative Number, Positive Number < 360, Positive Number > 360}
• It is assumed that the blocks function independently, so a member from each partition is tried once against each block.
• This test sequence itself follows a simple use case: the user wants to draw a box with a dome on top.