CS/APMA 202: Slides

Spring 2005

Home | Syllabus | Homeworks | Problem database | Slides | Resources | Exams

Note that these slides are subject to change!  I often update them after they are initially posted but before I am finished presenting them.  All the slides are Microsoft Powerpoint (you can download a free viewer here).  Note that some of the animation features used are only available in PowerPoint 2002 and later.

 

Daily announcements slides


  1. Course introduction
  2. Boolean logic (§ 1.1)
  3. Propositional equivalences (§ 1.2)
  4. Logic gates (§ 10.3)
  5. Sets (§ 1.6)
  6. Set operations (§ 1.7)
  7. Predicates and quantifiers (§ 1.3)
  8. Nested quantifiers (§ 1.4)
  9. Methods of proof (§ 1.5)
  10. Functions (§ 1.8) (end of material for first midterm)
  11. Integers and Division (§ 2.4)
  12. Applications of Number Theory (§ 2.6)
  13. Algorithms (§ 2.1)
  14. Growth of Functions (and NP completeness) (§ 2.2)
  15. Proof Strategies (§ 3.1)
  16. Sequences and Summations (§ 3.2)
  17. Mathematical Induction (§ 3.3)
  18. Recursive Definitions (§ 3.4)
  19. Basics of Counting (§ 4.1) (end of material for second midterm)
  20. Pigeonhole Principle (§ 4.2)
  21. Permutations and Combinations (§ 4.3)
  22. Binomial Coefficients (§ 4.4)
  23. Introduction to discrete probability (§ 5.1)
  24. Introduction to Relations (§ 7.1)
  25. Representing Relations (§ 7.3)
  26. Closures of Relations (§ 7.4)
  27. Equivalence Relations (§ 7.5)
  28. Partial Orderings (§ 7.6)
  29. Course summary


Last updated on[an error occurred while processing this directive]