* hw2
  - using print on problem 2
  - what did people do for problem 3?
  - working in pairs?

* hw3
  - will be sent out tonight.

* today - more fun with encryption, using functions
  - breaking the ceasar cipher 
    - try all 26 posibilities
    - make it so there are more than 26 possibilities
      + pick some permutation of the letters, 26! of those
      + then too many to try them all, but can still do frequency analysis.
  - use mod to do the wrapping around bit.
    - convert to number, subtract 'a', add shift amount (e.g., 1), % 26, add 'a',
      convert to letter.
  - using functions the right way to make our encryption more modular and easier
    to reuse.
  - have it ignore non-alphabetic characters.
  - functions: input arguments, output with return, indented to keep it separate
    from rest of the file.

* just for fun, function you can copy and paste to do frequency analysis
def letterCounts(text):
    print("")
    # make it lower case so we don't have to worry about both upper and lower.
    text = text.lower() 
    for letter in "abcdefghijklmnopqrstuv":
    	print("Count for " + letter + ": " + str(text.count(letter))

* introduce lists...
  - examples: shopping list, students in the class or at ISU, websites and their
    IP address, ...
  - things you want to do: add to the list, take off of the list, get one or more
    things from the list, look something up in the list.