CS/APMA 202: Syllabus

Spring 2005

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

Course Objectives

  1. Logic: Introduce a formal system (propositional and predicate logic) which mathematical reasoning is based on. (sections 1.1-1.4)
  2. Proofs: Develop an understanding of how to read and construct valid mathematical arguments (proofs) and understand mathematical statements (theorems), including inductive proofs. Also, introduce and work with various problem solving strategies and techniques. (sections 1.5, 3.1, 3.3, 3.4)
  3. Counting: Introduce the basics of integer theory, combinatorics, and counting principles, including a brief introduction to discrete probability. (sections 2.4, 4.1-4.4, 5.1)
  4. Structures: Introduce and work with important discrete data structures such as sets, relations, sequences, and discrete functions. (sections 1.6-1.8, 2.7, 3.2, 7.1, 7.3-7.6)
  5. Applications: Gain an understanding of some application areas of the material covered in the course. (sections 2.6, 3.6, 10.3)

 

Syllabus

View as a PDF


Tentative schedule

This is subject to change!
Week of
 Tuesday lecture
 Thursday lecture
 Sat
17 Jan - 21 Jan (no classes yet)
 Introduction, Logic and propositions (1.1-1.2)
24 Jan - 28 Jan Logic and propositions (1.1-1.2) Logic and propositions (1.1-1.2); Logic gates (10.3)
31 Jan - 4 Feb Sets and set operations (1.6-1.7) Sets and set operations (1.6-1.7), Predicates and quantifiers (1.3-1.4)
7 Feb - 11 Feb Predicates and quantifiers (1.3-1.4) Methods of proof (1.5)
14 Feb - 18 Feb Methods of proof (1.5), Functions (1.8) Functions (1.8), Integers and division (2.4)
21 Feb - 25 Feb Integers and division (2.4), Applications of number theory (2.6) Midterm 1
28 Feb - 4 Mar Applications of number theory (2.6), Algorithms (2.1) Algorithms (2.1), Growth of functions (2.2)
7 Mar - 11 Mar Spring recess Spring recess
14 Mar - 18 Mar Growth of functions (and NP completeness) (2.2), Proof Strategies (3.1) Proof Strategies (3.1), Sequences and summations (3.2)
21 Mar - 25 Mar Induction (3.3) Induction (3.3),  Recursive Definitions (3.4)
28 Mar - 1 Apr Recursive Definitions (3.4), Intro to Counting (4.1) Pigeonhole principle (4.2), Permutations and combinations (4.3)
4 Apr - 8 Apr Permutations and combinations (4.3), Binomials (4.4) Midterm 2
11 Apr - 15 Apr Binomials (4.4), Intro to Discrete Probability (5.1) Intro to Discrete Probability (5.1)
18 Apr - 22 Apr Intro to Discrete Probability (5.1), Program Correctness (3.6) Program Correctness (3.6)
25 Apr - 29 Apr Matrices (2.7), Relations (7.1, 7.3, 7.4) Relations (7.1, 7.3, 7.4)
2 May - 6 May Equivalence relations (7.5), Partial Orders (7.6) No class Final exam from 9:00-noon
 

Other useful dates:

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