Notes on homework 2

• Consider this:
  • If you can't write programs to solve these simple problems with very few restrictions...
  • Do I want you writing code:
    • To write a script to back up my files?
    • To compute my paycheck?
    • To drive a car?
    • To take my on-line order for presents for my wife's birthday?
    • To write a game I will spend hours playing before it has an unrecoverable crash, overwrites the save file and I can't finish it?
• If you did not turn in one of the programs, you may not resubmit for that program.
  • See the grading policy relating to re-submissions.

    	If you turn your assignment in on time or early, you may at your option,
    	resubmit it once after performing corrections and receive a higher score.
    	This option is not available to late submissions, or to submissions
    	judged by the instructor to be simply place holders for late homework.
    	

• Violations of the following will, at my discretion, render ENTIRE projects ineligible for resubmissions:
  • FOLLOW NAMING CONVENTIONS
  • Your makefile should build all executables.
  • No executables in your tar file.
  • Your indentation should be right.
  • You don't put your name in the source code files.
  • No silly single line main routines.
  • Your programs should compile
  • You don't follow basic instructions or miss a major portion of the assignment.
  • You don't pay attention to the feedback from a previous assignment.
  • Your code does not compile without warnings with the required flags.
• All three of these are integer computations, no non integer types.
• Don't do this:

  • rv = true;
    return rv;
    	

• If you crash on this ~!@#$%^&*()_+=--=+_)(*&^%$#@!~ you need to be careful.
  • This is a very strange case to crash on.
  • And multiple people only crashed on this case.
  • And many of their palindrome checking routines were very strange
  • AND WRONG.
  • This is an indication that you worked too closely.
• Fibonacci
  • The sizes should be a constant. (20,50)
  • The fibonacci function should compute a fibonacci number, no output.
  • Reset both the count and the time when measuring performance of the fib functions.
  • Your non-recursive fib function should not rely on previous calls to compute the value.
    • In other words, the following should print the correct value for the 30th fib number.

    • int main() {
          cout <<NRFib(30)  << endl;
          return 0;
      }
      	     

• Ackermanns
  • The max sizes should be constants (3,4)
  • All output, including column headers should use these constants
  • Column headings should be printed in a loop.

    for(i=0;i<N_LIMIT;i++) {
       cout << setw(5) << i;
    }
    cout << endl;
    
    NOT
    // this is NOT code that can be modified easily.
        cout << "m\\n  |     0    1    2    3    4" << endl;
        cout << "-----+--------------------------" << endl;
    

  • Notice my columns line up, not an extra space

    m\n |     0    1    2    3    4
    -----+--------------------------
      0 |     1    2    3    4    5
    
    Not:
    m\n |    0    1    2    3    4
    ----+--------------------------
      0 |     1    2    3    4    5
    
    AND NOT:
    m\n |      0    1    2    3    4
    ----+---------------------------
      0 |     1    2    3    4    5
    
    	 

• Palindrome:
  • Talk about recursive function.
  • Output Function

    void PrintAnswer(string phrase, bool isPal) {
       if (isPal) {
          cout << '"' << phrase << '"' << YES_PHRASE << endl;
       } else {
          cout << '"' << phrase << '"' << NO_PHRASE << endl;
       }
       return;
    }
    
    //consider
    // This will make modification when you print the phrase out wrong easier
    void PrintAnswer(string phrase, bool isPal) {
      cout << '"' << phrase << '"' ;
       if (isPal) {
          cout << YES_PHRASE << endl;
       } else {
          cout << NO_PHRASE << endl;
       }
       return;
    }