Source: http://www.cs.carleton.edu/faculty/dlibenno/old/cs202-spring14.html
Timestamp: 2019-04-25 18:50:14+00:00

Document:
Office Hours: see my homepage. Always feel free to email for an appointment if the scheduled times aren't good for you.
This webpage was originally stored in Moodle, which does not have an easy capacity to publish a version of an old webpage for a course. Major thanks to Dave Musicant, whose Moodle-scraping tool I used to generated this page, which is an approximation of the original.
the anonymous feedback form for CS 202.
the Piazza site for CS 202.
LaTeX materials: installing LaTeX on your computer; a tutorial [MIT]; a reference guide [Cambridge]; the LaTeX Wikibook; a symbol finder; a table editor.
Reading: DLN §1,§3.1, §3.2; propositional logic in a page.
Optional: Champion at Checkers That Cannot Lose to People (K. Chang, NYT, 20 Jul 2007); Checkers is Solved (J. Schaeffer et al, Science, Sep 2007).
Wednesday: truth tables, logical equivalence, some propositional logic challenges, Rowena.
Think about the Sheffer stroke challenge problems for Friday.
Friday: Sheffer stroke, making $1,000,000 with logic; predicates and quantifiers.
Reading: DLN §3.4, §3.5; predicate logic in one page.
Monday: predicates and quantifiers; NLP; game trees, tic-tac, and Deep Blue; a hint of proofs?
Reading: DLN §2.6, §4.1–§4.3; as you please, the notation summary below.
Totally optional reading: "Your Move" and "In the Bird Cage", from The New Yorker.
Wednesday: game tree wrapup; proofs (why and how).
Reading: DLN §2.1, §2.3; skim §2.2 and read §2.2's CS Connections; datatypes in a page.
Friday: proofs strategies, broken proofs, basic datatypes.
Monday: proofs wrapup; error-correcting codes.
Reading: DLN §4.5 (and refer to Chapter 2 as necessary).
Wednesday: error-correcting codes (general properties and Hamming codes).
Come to class on Friday with messages corresponding to the (possibly corrupted) Hamming code codewords I gave you in class.
Friday: Hamming codes, Reed–Solomon codes, and secret-sharing.
Reading: DLN p. 728–729 and §5.1; start on DLN §5.2.
No new problem set assigned; focus instead on preparing for prelim #1 on Friday. For the exam, you may bring one 8.5"-by-11" sheet of paper containing notes handwritten or typed by you. You may write on both sides of the paper. Any material up to and including secret sharing (so through class today, through Chapter 4, and through ps09) is fair game.
Extension: we're a day behind, so you're not ready for ps10 (which was scheduled to be due on Wednesday) yet. You can do it anyway, but I'm officially granting you all an extra late pass that you can use to hand in ps10 on Monday. I will probably also give you an extra half problem set for Monday, which will be assigned on Wednesday.
Wednesday: proofs by mathematical induction.
Reading: DLN §5.3 (for Monday).
Reminder: prelim #1 on Friday!
Monday: proofs by strong induction; the Fibonacci numbers.
Wednesday: Fibonacci wrapup; "code review" of ps09; problems and algorithms.
Read DLN §6.3 and the Fibonacci handout.
Complete ps14 in your assigned group by next Wednesday.
Friday: midterm evals; efficiency; O/Ω/Θ.
Reading: DLN §6.1–6.3; start §6.4.
Enjoy the "break" on Monday!
Complete ps16 for Friday Monday.
Friday: recurrence relations; the master method.
Reading: recurrence relations in a page (see below); review DLN Chapter 6.
Complete ps17 in your assigned groups by next Friday.
Monday: master method wrapup; counting.
Reading: DLN §9.3–9.4; counting in a page.
Friday: counting exercises, pigeonhole principle, combinatorial proofs, weekend magic.
No new problem set assigned; focus instead on preparing for prelim #2 on Friday. For the exam, you may bring one 8.5"-by-11" sheet of paper containing notes handwritten or typed by you. You may write on both sides of the paper. Any material up to and including counting (so through class Friday/today, through Chapter 9, and through ps19) is fair game.
Wednesday: quick-fire tour of probability.
Reminder: prelim #2 is on Friday.
Monday: cryptography; modular arithmetic; greatest common divisors.
Wednesday: GCDs/Euclidean algorithm/the extended Euclidean algorithm; multiplicative inverses.
Reading: DLN §7.3 [up to top of p. 721] and §7.4.
Friday: multiplicative inverses and Fermat's Little Theorem.
Complete ps23 in your assigned partnerships by Wednesday (the last day of class).
Your crib sheets for the final (as before: 8.5"-by-11", two sides, ...) are due in the suite outside my office (Weitz 225) by the end of the day on Wednesday.
Wednesday: RSA wrapup; course evals; ask me anything.

References: §1
 §3
 §3
 §3
 §2
 §4
 §2
 §2
 §2
 §2
 §4
 §5
 §5
 §5
 §6
 §6
 §6
 §9
 §7
 §7