From 442a49ad5a48d417345959b903ae6a6d32d55759 Mon Sep 17 00:00:00 2001
From: Haidong Ji
Date: Fri, 15 Apr 2022 15:51:30 -0500
Subject: Great C programming fun

Excellent fundamentals and displine training, many tools and techniques
exercises: gdb, emacs, valgrind, git
---
 08_testing/README | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 08_testing/README

(limited to '08_testing/README')

diff --git a/08_testing/README b/08_testing/README
new file mode 100644
index 0000000..90b0008
--- /dev/null
+++ b/08_testing/README
@@ -0,0 +1,32 @@
+In this assignment, you will be black-box testing a few 
+broken implementations of "isPrime".  You will see
+that there are four broken implementations of isPrime:
+
+isPrime-broken1
+isPrime-broken2
+isPrime-broken3
+isPrime-broken4
+
+as well as a correct implementation:
+
+isPrime-correct
+
+All of these take one command line argument, which is the *integer*
+to test for primality.  For example, you might run
+
+$ ./isPrime-correct  3
+3 is prime
+$ ./isPrime-correct 4
+4 is not prime
+
+Your job is to find a test case for each broken implementation which
+shows that it is not correct---that is, where its behavior differs
+from that of isPrime-correct. Note that we do not expect you to brute
+force this task. Think about what types of common errors could occur.
+
+For each broken program, write the input which breaks the program
+into a file called "input.X" where X is 1, 2, 3, or 4 (so input.1 has
+the command line argument that shows that isPrime-broken1 is broken).
+
+Note that isPrime-correct's behavior is considered correct, and
+any test case which deviates from it is considered wrong.
-- 
cgit v1.2.3