Input Space Partitioning

Objectives

• Use Input Space Partitioning to create test cases.

Tasks

1. (10 points) Consider the problem that given a text file, output the word tokens and their frequencies. For this problem, define input space partitions that satisfy the completeness and disjointness properties. Explain why your partitions are complete and disjoint. Feel free to make and state assumptions about the text and the tokens.

2. (10 points) Derive input space partitioning tests for the Pawn class that you implemented in A1. You can write these tests in plain text (stating the prefix values, expected values, etc) or in JUnit format.

3. (10 points) Do all parts (a-e) of problem 6 (BoundedQueue) in the Ammann and Offutt textbook, edition 2, on page 91. If you have edition 1, then the question appears on page 164 as question 5.

Submission

Type the answers to the above questions in a document called a3.pdf. Submit the file using Assignment Submission in Canvas.