For this project, your are to write a program that checks to see whether
input strings are palindromes. A palindrome is a string which reads the
same forward and backward. Your program should ignore spaces and
punctuation, and shouldn't care about upper and lower case of letters.
This can be done by reading the string, pushing each letter
on both a stack and a queue, and then popping from both and comparing
the letters (the queue will be in the original order, the stack in
reverse order).
Do this with two classes (stack and queue) and a driver program . . .
Examples of palindromes:
Submission: Submission: Use the CS homework submission system. Submit (at least) three files. Be sure to clearly identify yourself in the comments of your program (i.e., with your real name :-).
Input data: The input to the program will come from standard
input. I will test your program with various examples
Scoring: The maximum possible score for the project
will be 80 points. There will be up to 40 points for correct
operation of your program, and up to 40 points for style,
comments, etc.
Late programs will have their maximum possible score reduced
to 0.9 times previous for each calendar day late (i.e.,
maximum possible score = 80 * (0.9^n) for n days late . . .).