Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 Principles of Computer Science I Prof. Nadeem Abdul Hamid CSC 120 – Fall 2005 Lecture Unit 10 - Testing.

Similar presentations


Presentation on theme: "1 Principles of Computer Science I Prof. Nadeem Abdul Hamid CSC 120 – Fall 2005 Lecture Unit 10 - Testing."— Presentation transcript:

1 1 Principles of Computer Science I Prof. Nadeem Abdul Hamid CSC 120 – Fall 2005 Lecture Unit 10 - Testing

2 2 Testing Important for discovering and fixing errors in programs (bugs) Unit tests Most common method of testing program code Tests classes/methods in isolation, not the complete program For each test, you provide a simple class called a test harness Test harness feeds parameters to the methods being tested CSC120 — Berry College — Fall 2005

3 3 Example: Square Root Algorithm To compute the square root of a use a common algorithm: Guess a value x that might be somewhat close to the desired square root (x = a is ok) Actual square root lies between x and a/x Take midpoint (x + a/x) / 2 as a better guess Repeat the procedure. Stop when two successive approximations are very close to each other

4 4 Example: Polygons Methods for area and perimeter What polygons with known area/perimeter would you use as input?

5 5 Providing Test Cases Using input from user Hard to repeat and remember inputs Hardwire test inputs into test harness Alternative: put test inputs in a file and send through test harness Automatically generate test inputs using a loop Usually restricted to a small set of values Random generation of test cases

6 6 Choosing Test Cases Selecting good test cases is an important skill for debugging programs Test all features of the methods that you are testing Test typical test cases 100, 1/4, 0.01, 2, 10E12 Test boundary test cases: test cases that are at the boundary of acceptable inputs, eg. 0 Programmers often make mistakes dealing with boundary conditions Division by zero, extracting characters from empty strings, and accessing null pointers

7 7 Reading Test Inputs From a File Use input redirection: java Program < input.txt Some IDEs may not support this Then, use the command window (terminal/shell) Output redirection: java Program > output.txt

8 8 Regression Testing Save test cases Use saved test cases in subsequent versions A test suite is a set of tests for repeated testing Cycling = bug that is fixed but reappears in later versions Regression testing: repeating previous tests to ensure that known failures of prior versions do not appear in new versions

9 9 Test Coverage Black-box testing: test functionality without consideration of internal structure of implementation White-box testing: take internal structure into account when designing tests Test coverage: measure of how many parts of a program have been tested Make sure that each part of your program is exercised at least once by one test case e.g., make sure to execute each branch in at least one test case

10 10 Test Coverage Tip: write first test cases before program is written completely → gives insight into what program should do Modern programs can be challenging to test Graphical user interfaces (use of mouse) Network connections (delay and failures) There are tools to automate testing in this scenarios Basic principles of regression testing and complete coverage still hold

11 11 Exercises P10.1, P10.2, 10.5


Download ppt "1 Principles of Computer Science I Prof. Nadeem Abdul Hamid CSC 120 – Fall 2005 Lecture Unit 10 - Testing."

Similar presentations


Ads by Google