CSCE 2014 - Homework 3
Due Date - 03/04/2013 at 11:59 PM

1. Problem Statement:

The goal of this assignment is to implement and evaluate 10 recursive functions. The functions do not need to be big or fancy, but they do need to be correct. Students can borrow and adapt C++ code from the lecture notes, the lab descriptions, or the text book. Students can also write their own recursive functions.

2. Design:

This is an unusual programming assignment because we are not solving a single design problem. Instead, we are implementing and evaluating a collection of 10 unrelated functions. The goal is to demonstrate that each of your functions is working correctly. To do this, you need to write a "testing function" for each of the recursive functions that shows what happens when the function is called with different parameters. Your main program will then call the 10 testing functions to perform a massive experiment verifying the correctness of your 10 recursive functions. For example, here is what the test function for factorial would look like:

//-------------------------------------------------------------------
int factorial(int num)
{
   cout << "Entering factorial " << num << endl;
   int result = 0;

   // check terminating conditions
   if (num <= 1)
      result = 1;

   // handle recursive case
   else
      result = num * factorial(num - 1);

   cout << "Leaving factorial " << num << endl;
   return result;
}

//-------------------------------------------------------------------
void test_factorial()
{
   // terminating conditions
   cout << "\nTesting factorial\n";
   cout << "factorial(0) = " << factorial(0) << endl;
   cout << "factorial(1) = " << factorial(1) << endl;

   // recursive conditions
   for (int i = 2; i <= 10; i++)
      cout << "factorial(" << i << ") = " << factorial(i) << endl;

   // error conditions
   cout << "factorial(-1) = " << factorial(-1) << endl;
}

3. Implementation:

You can implement this program using either a bottom-up approach or a top-down approach. If you go for a bottom-up approach, start by creating basic methods and classes, and test theses methods using a simple main program that calls each method. When this is working, you can create the main program that uses these methods to solve the problem above.

If you go for a top-down approach, start by creating your main program that reads user input, and calls empty methods to pretend to solve the problem. Then add in the code for these methods one at a time. This way, you will get an idea of how the whole program will work before you dive into the details of implementing each method and class.

Regardless of which technique you choose to use, you should develop your code incrementally adding code, compiling, debugging, a little bit at a time. This way, you always have a program that "does something" even if it is not complete.

4. Testing:

Test your program to check that it operates correctly for all of the requirements listed above. Also check for the error handling capabilities of the code. Test your program and save your testing output in text files for submission on the program due date.

5. Documentation:

When you have completed your C++ program, write a short report (less than one page long) describing what the objectives were, what you did, and the status of the program. Does it work properly for all test cases? Are there any known problems? Save this report in a separate text file to be submitted electronically.

6. Project Submission:

In this class, we will be using electronic project submission to make sure that all students hand their programming projects and labs on time, and to perform automatic analysis of all programs that are submitted. When you have completed the tasks above go to the class web site to "submit" your documentation, C++ program, and testing files.

The dates on your electronic submission will be used to verify that you met the due date above. All late projects will receive reduced credit (50% off if less than 24 hours late, no credit if more than 24 hours late), so hand in your best effort on the due date.