Math 181 Spring 2007 Tentative Outline

• wk1:
  • intro to logic
  • into to deducitive logic - universal/existential statements,( rules of inference)
• wk2:
  • rules of inference/connectives & fallacies
  • formal arguments(i.e. applying the rules of inference)
• wk3:
  • Knights and Knaves/Logic Puzzles
  • Ch 2 & CH 3 PIL (Gambler's Fallacy)
• wk4:
  • finish Ch 3 PIL
  • Cprobability packet sections 4.1, 4.3, some 4.4
• wk5:
  • Conditional probability, rules of probability
  • Bayes' rule
• wk6:
  • Conditional probability, Bayes' rule and First exam

• wk7: (2/26/07 - 3/1/07)
  • Counting, permutations & combinations (sections 4.5+ in probability packet)
  • reports due
• wk8: (3/5/07 - 3/9/07)
  • Graphs as a set of vertices and a relation-set, as a diagram
  • paths, circuits, Hamiltonian circuits, minimum cost hamiltonian circuits
  • Nearest Neighbor and Sorted edges algorithms
• wk9: (3/12/07-3/16/07)
  • Trees, Spanning trees, Algorithms for finding min cost spanning trees
  • Planarity and coloring
• SPRING BREAK
• wk10: (3/26/07-3/30/07)
  • Graph Coloring
  • Review
  • Midterm 2
  Totals for weeks 7 though 10: 1 report, 3 homeworks, 3 quizzes, 11 lectures, 1 exam
• wk11: (4/2/07-4/06/07)
  • Integers, divisibility, primes, Sieve of Eratosthenes.
  • Turing's Bicycle
  • Caesar Cipher/ Shift Codes
  • hwk8, quiz 8
• wk12: (4/9/07-4/13/07)
  • Shift codes
  • Affine Cipher encode
  • Affine Ciper decode & Hill Cipher Encode
  • hwk9, quiz 9
• wk13: (4/16/07-4/20/07)
  • Hill Ciper Decode & RSA Encode
  • RSA Encode and Euclidean algorithm (prepping for inverses)
  • Inverses & Decoding in RSA
  • hwk 10, quiz 10
• wk14: (4/23/07-4/27/07)
  • Finish RSA
  • REVIEW
  • hwk 11
  • Exam 3
  Totals for weeks 11 though 11: 4 homeworks, 3 quizzes, 11 lectures, 1 exam