All problems are from the textbook (starting on page 98) unless otherwise noted.
These do not have to be run on the computer, and there will not be an electronic turn-in. Of course, you are welcome to get them actually running. If you write them by hand, they must be clear and 100% legible. We won't try to decipher obscure handwriting! As on everything you hand in, be sure to include your name, student ID, quiz section, etc. Staple all pages together.
Chances are the problems will not be graded in detail, but an answer key will be available for you to study. There will be similar problems on the midterm exam or the final exam, so you really should try to solve them on your own.
Special note: You will find that many of the problems are understated; that is, the instructions are not very detailed. Although you can always ask for clarification, you should also the develop the habit of reading between the lines and applying common sense to figure out what is really asked for, and what an acceptable answer is. It's a good survival skill!
#1
#5
#6
#9
#11
Challenge problem (optional). This is a modification of a quiz section worksheet problem, which reads "Write a recursive function that takes a string of characters as input and returns true if and only if the string is a palindrome." Now, the humorous palindromes we saw in class require you to ignore spaces, capitalization, and punctuation to make them work, as in "Madame, I'm Adam." Write a function check_pal which checks English phrases and sentences to see if they are palindromes. Make your solution purely recursive -- no while or for allowed.
Super-duper Ultimate challenge problem (this might be a doctoral thesis for somebody): Develop a system which invents humorous or insightful palindromes.