----------------------- Exercise #7 for CST8129 due October 26, 2005 ----------------------- -Ian! D. Allen - idallen@idallen.ca Remember - knowing how to find out an answer is more important than memorizing the answer. Learn to fish! RTFM! (Read The Fine Manual) Global weight: 1% of your total mark this term Due date: Before the end of your Lab period on Wednesday, October 26. The online deliverables for this exercise are to be submitted online via the T127 Linux Lab using the submit method described in the exercise description, below. No paper; no email; no FTP. Late-submission date: None. This exercise is due before the end of your Lab period on October 26. Exercise Synopsis: 1. Write a "black box" test plan exercise07testplan.txt that specifies tests of a three-integer sorting algorithm for key combinations of command line arguments. In words, explain and justify each test. Explain how your tests demonstrate that the algorithm will work for any three integers (including inputs with two or three identical integers). With only three integers as input, the number of tests you need to exhaustively cover all possible relationships of the three (smaller, same, larger) is reasonably small (a bit more than a dozen tests). Using your test plan, with help from your instructor as needed, correct any errors in the PDL and code of your integer sorting algorithm. (This is not for hand in today.) Take a look at the upcoming Exercise #8 draft (your first "Assignment"). (This is not for hand in today.) Submission ---------- Submit the finished and labelled (with your Assignment Label at the top) Test Plan file for marking using the following Linux command line: $ ~alleni/bin/copy exercise07testplan.txt This program will copy the selected file to me for marking. You can copy the file more than once. Only the most recent copies will be marked. This exercise is due at the end of your lab period today. P.S. Did you spell all the label fields and file names correctly?