Presentation is loading. Please wait.

Presentation is loading. Please wait.

Prime Factors Kata Object Mentor, Inc. fitnesse.org Copyright  2005 by Object Mentor, Inc All copies must retain this page unchanged. www.junit.org www.objectmentor.com.

Published byMagdalene Andrews Modified over 9 years ago

Similar presentations

Presentation on theme: "Prime Factors Kata Object Mentor, Inc. fitnesse.org Copyright  2005 by Object Mentor, Inc All copies must retain this page unchanged. www.junit.org www.objectmentor.com."— Presentation transcript:

1 Prime Factors Kata Object Mentor, Inc. fitnesse.org Copyright  2005 by Object Mentor, Inc All copies must retain this page unchanged. www.junit.org www.objectmentor.com blog.objectmentor.com

2 Generating Prime Factors. Although quite short, this kata is fascinating in the way it shows how ‘if’ statements become ‘while’ statements as the number of test cases increase. It’s also a wonderful example of how algorithms sometimes become simpler as they become more general. I stumbled upon this little kata one evening when my son was in 7 th grade. He had just discovered that all numbers can be broken down into a product of primes and was interested in exploring this further. So I wrote a little ruby program, test- first, and was stunned by how the algorithm evolved. I have done this particular kata in Java 5.0. This should give you a feel for the power and convenience of some of the new features.

3 The Requirements. Write a class named “PrimeFactors” that has one static method: generate. –The generate method takes an integer argument and returns a List. That list contains the prime factors in numerical sequence.

4 Begin. Create a project named PrimeFactors Create a package named primeFactors Create a unit test named PrimeFactorsTest package primeFactors; import junit.framework.TestCase; public class PrimeFactorsTest extends TestCase { } No tests found in primeFactors.PrimeFactorsTest

5 The first test. package primeFactors; import junit.framework.TestCase; public class PrimeFactorsTest extends TestCase { public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); }

6 The first test. package primeFactors; import junit.framework.TestCase; import java.util.List; public class PrimeFactorsTest extends TestCase { public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } private List list() { return null; }

7 The first test. package primeFactors; import junit.framework.TestCase; import java.util.List; public class PrimeFactorsTest extends TestCase { public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } private List list() { return null; } package primeFactors; public class PrimeFactors { }

8 The first test. package primeFactors; import junit.framework.TestCase; import java.util.List; public class PrimeFactorsTest extends TestCase { public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } private List list() { return null; } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { return new ArrayList (); } expected: but was:

9 The first test. package primeFactors; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } private List list() { return new ArrayList (); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { return new ArrayList (); }

10 The first test. package primeFactors; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list() { return new ArrayList (); } public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { return new ArrayList (); }

11 The Second Test

12 The Second test. package primeFactors; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list() { return new ArrayList (); } public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),PrimeFactors.generate(2)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { return new ArrayList (); }

13 The Second test. package primeFactors; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),PrimeFactors.generate(2)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { return new ArrayList (); } varargs expected: but was:

14 The Second test. package primeFactors; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),PrimeFactors.generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),PrimeFactors.generate(2)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { primes.add(2); } return primes; }

15 The Second test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { primes.add(2); } return primes; }

16 The Third Test

17 The Third test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { primes.add(2); } return primes; } expected: but was:

18 The Third test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { primes.add(n); } return primes; }

19 The Fourth Test

20 The Fourth test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { primes.add(n); } return primes; } expected: but was:

21 The Fourth test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { if (n%2 == 0) { primes.add(2); n /= 2; } if (n > 1) primes.add(n); } return primes; }

22 The Fifth Test

23 The Fifth test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { if (n%2 == 0) { primes.add(2); n /= 2; } if (n > 1) primes.add(n); } return primes; }

24 The Sixth Test

25 The Sixth test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { if (n%2 == 0) { primes.add(2); n /= 2; } if (n > 1) primes.add(n); } return primes; } expected: but was:

26 The Sixth test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { while (n%2 == 0) { primes.add(2); n /= 2; } if (n > 1) primes.add(n); } return primes; } ! ! !

27 The Seventh Test

28 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { while (n%2 == 0) { primes.add(2); n /= 2; } if (n > 1) primes.add(n); } return primes; } expected: but was:

29 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { int candidate = 2; while (n%candidate == 0) { primes.add(candidate); n /= candidate; } if (n > 1) primes.add(n); } return primes; } expected: but was:

30 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); if (n > 1) { int candidate = 2; while (n % candidate == 0) { primes.add(candidate); n /= candidate; } if (n > 1) primes.add(n); return primes; } expected: but was:

31 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); int candidate = 2; if (n > 1) { while (n % candidate == 0) { primes.add(candidate); n /= candidate; } if (n > 1) primes.add(n); return primes; } expected: but was:

32 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); int candidate = 2; if (n > 1) { while (n % candidate == 0) { primes.add(candidate); n /= candidate; } if (n > 1) primes.add(n); return primes; } expected: but was:

33 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); int candidate = 2; while (n > 1) { while (n % candidate == 0) { primes.add(candidate); n /= candidate; } candidate++; } if (n > 1) primes.add(n); return primes; } ! ! !

34 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); int candidate = 2; while (n > 1) { while (n % candidate == 0) { primes.add(candidate); n /= candidate; } candidate++; } return primes; }

35 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); int candidate = 2; while (n > 1) { for (; n%candidate == 0; n/=candidate) primes.add(candidate); candidate++; } return primes; }

36 The Seventh test. package primeFactors; import static primeFactors.PrimeFactors.generate; import junit.framework.TestCase; import java.util.*; public class PrimeFactorsTest extends TestCase { private List list(int... ints) { List list = new ArrayList (); for (int i : ints) list.add(i); return list; } public void testOne() throws Exception { assertEquals(list(),generate(1)); } public void testTwo() throws Exception { assertEquals(list(2),generate(2)); } public void testThree() throws Exception { assertEquals(list(3),generate(3)); } public void testFour() throws Exception { assertEquals(list(2,2),generate(4)); } public void testSix() throws Exception { assertEquals(list(2,3),generate(6)); } public void testEight() throws Exception { assertEquals(list(2,2,2),generate(8)); } public void testNine() throws Exception { assertEquals(list(3,3),generate(9)); } package primeFactors; import java.util.*; public class PrimeFactors { public static List generate(int n) { List primes = new ArrayList (); for (int candidate = 2; n > 1; candidate++) for (; n%candidate == 0; n/=candidate) primes.add(candidate); return primes; } The algorith is three lines of code!

37 END

Download ppt "Prime Factors Kata Object Mentor, Inc. fitnesse.org Copyright  2005 by Object Mentor, Inc All copies must retain this page unchanged. www.junit.org www.objectmentor.com."

Similar presentations

Bowling Game Kata Object Mentor, Inc. fitnesse.org Copyright 2005 by Object Mentor, Inc All copies must retain this page unchanged. www.junit.org www.objectmentor.com.

Bowling Game Kata Object Mentor, Inc. fitnesse.org Copyright 2005 by Object Mentor, Inc All copies must retain this page unchanged.
Chapter 1 Writing a Program Fall 2011. Class Overview Course Information –On the web page and Blackboard –www.uncp.edu/home/lilliec/www.uncp.edu/home/lilliec/

Chapter 1 Writing a Program Fall Class Overview Course Information –On the web page and Blackboard –
Problem Solving 5 Using Java API for Searching and Sorting Applications ICS-201 Introduction to Computing II Semester 071.

Problem Solving 5 Using Java API for Searching and Sorting Applications ICS-201 Introduction to Computing II Semester 071.
Programming with Java. Problem Solving The purpose of writing a program is to solve a problem The general steps in problem solving are: –Understand the.

Programming with Java. Problem Solving The purpose of writing a program is to solve a problem The general steps in problem solving are: –Understand the.
Type Title Here for Tic-Tac-Toe Type names of students in group here.

Type Title Here for Tic-Tac-Toe Type names of students in group here.
Designing an ADT The design of an ADT should evolve naturally during the problem-solving process Questions to ask when designing an ADT What data does.

Designing an ADT The design of an ADT should evolve naturally during the problem-solving process Questions to ask when designing an ADT What data does.
Overloading methods review When is the return statement required? What do the following method headers tell us? public static int max (int a, int b)

Overloading methods review When is the return statement required? What do the following method headers tell us? public static int max (int a, int b)
Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Java Software Solutions Foundations of Program Design Sixth Edition by Lewis.

Copyright © 2009 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Java Software Solutions Foundations of Program Design Sixth Edition by Lewis.
JUnit, Revisited 17-Apr-17.

JUnit, Revisited 17-Apr-17.
Grouping Objects 1 Introduction to Collections.

Grouping Objects 1 Introduction to Collections.
Lecture 5 of Computer Science II Arrays Instructor: Mr.Ahmed Al Astal.

Lecture 5 of Computer Science II Arrays Instructor: Mr.Ahmed Al Astal.
Programming with Collections Grouping & Looping - Collections and Iteration Week 7.

Programming with Collections Grouping & Looping - Collections and Iteration Week 7.
16-Aug-15 Java Puzzlers From the book Java Puzzlers by Joshua Bloch and Neal Gafter.

16-Aug-15 Java Puzzlers From the book Java Puzzlers by Joshua Bloch and Neal Gafter.
Java Software Solutions Lewis and Loftus Chapter 2 1 Copyright 1997 by John Lewis and William Loftus. All rights reserved. Software Concepts -- Introduction.

Java Software Solutions Lewis and Loftus Chapter 2 1 Copyright 1997 by John Lewis and William Loftus. All rights reserved. Software Concepts -- Introduction.
EFFICIENCY & SORTING CITS1001. Listen to the sound of sorting Various algorithms Quicksort

EFFICIENCY & SORTING CITS1001. Listen to the sound of sorting Various algorithms Quicksort
University of Limerick1 Work with API’s. University of Limerick2 Learning OO programming u Learning a programming language can be broadly split into two.

University of Limerick1 Work with API’s. University of Limerick2 Learning OO programming u Learning a programming language can be broadly split into two.
1 Identifiers  Identifiers are the words a programmer uses in a program  An identifier can be made up of letters, digits, the underscore character (

1 Identifiers  Identifiers are the words a programmer uses in a program  An identifier can be made up of letters, digits, the underscore character (
Java™ How to Program, 9/e Presented by: Dr. José M. Reyes Álamo © Copyright 1992-2012 by Pearson Education, Inc. All Rights Reserved.

Java™ How to Program, 9/e Presented by: Dr. José M. Reyes Álamo © Copyright by Pearson Education, Inc. All Rights Reserved.
Test Automation For Web-Based Applications Portnov Computer School Presenter: Ellie Skobel.

Test Automation For Web-Based Applications Portnov Computer School Presenter: Ellie Skobel.
Introduction to Testing 1. Testing  testing code is a vital part of the development process  the goal of testing is to find defects in your code  Program.

Introduction to Testing 1. Testing  testing code is a vital part of the development process  the goal of testing is to find defects in your code  Program.

Similar presentations

Ads by Google