CISC2000: Computer Science II LAB 4

Grading Criteria

In this lab, we will be playing with c++ strings and vectors You will practice:

1. How to use the most common interface methods of strings and vectors

   What is a palindrome?

    

   A palindrome is a string that is the same when read left to right as when read right to left. Let's write a program that determines if an arbitrary string is a palindrome. Assume that the string can have blanks, punctuation, capital letters and lower case.

    

   Palindrome Examples:

   A man, a plan, a canal, Panama.

   Able was I 'ere I saw Elba.

   Madam, I'm Adam.

   Racecar

    

   Sample Program Output:

    

   Enter your palindrome or type quit:
   A man, a plan, a canal, Panama.
   Enter your palindrome or type quit:
   Be at a time I emit a beat
   Enter your palindrome or type quit:
   Racecar
   Enter your palindrome or type quit:
   A lad named E. Mandala
   Enter your palindrome or type quit:
   A Toyota's a Toyota
   Enter your palindrome or type quit:
   >Race and tell a dancer
   Enter your palindrome or type quit:
   quit
   Palindromes:
           A man, a plan, a canal, Panama.
           Racecar
           A lad named E. Mandala
           A Toyota's a Toyota
   NOT Palindromes:
           Be at a time I emit a beat
           Race and tell a dancer
   
   

    

   Palindrome Algorithm

   1. Make sure to keep the original string.
   2. Remove all punctuation, whitespace and special characters.
   3. Convert the string to lower case.
   4. Create a reverse copy of the string.
   5. Compare the clean version to the reverse version.

       If the clean string equals the reverse, it is a palindrome

       Otherwise it is not…

   Make sure not to change the original string!

   Program Functions

   Follow the model that we went over together in class. use the algorithm above and call your prepocessing functions from the isPalindrome function

   This program requires a minimum of 4-5 functions:

   // ToDo: Remember to declare your functions and provide good comments on both // prototypes and function headers.

    

   #include <iostream>
   // ToDo: Add include files
   
   using namespace std;
   
   

   // ToDo: Declare your functions and provide good comments on the prototypes.

    

   int main() {

       // ToDo: Declare two vectors of strings to save the input strings: palindromes, not_palindromes.

       // ToDo: Implement a loop to read in the palindrome strings using getline until the user quits.

       // ToDo: In the loop, call the isPalindrome function on the input string and store it in the
    // palindromes vector if true and the notPalindromes vector if false.

       // ToDo: After exiting the loop, print the list of palindromes under a Palindrome heading and
    // the list that are not palindromes under a Not Palindrome heading.

   }

   // ToDo: Implement your functions. Remember to provide good comments on them.

   Hints

   • You should work on your program so that it's always compilable: i.e, work on one function at a time, implement it, test it and modify the funciton until it works. Only then, you move on to next one.
   • Start with the simiplest function. The suggested order to write the function is:
     1. convert_to_lower function
     2. remove_punctuation function
     3. is_palindrome function
   • Write comments to 1) document your algorithms and design, 2) make your code readable, 3) debug code.

   Submission

   Submit to autograder: https://storm.cis.fordham.edu