Previous Weeks in the Math 210 Course

This file will contain the week-to-week reading and lecture schedules as they actually happened.  At the end of the week the "this week" page will be modified to reflect what actually happened and will be appended to this file.

Week 1: Monday, September 3

  • Topics:
    • Introduction  
    • Review of logic
  • Reading
    • 1.1 - 1.4

Monday:

  • Labor Day (no classes or office hours)

Tuesday:

  • Introduction to the course

Thursday:

  • Review of logic (1.1 - 1.2)
  • Connections with digital circuits

Friday:

  • Tautologies

Other Notes:

  • Monday is Labor Day (no classes or office hours)
  • Office Hours resume next week

Week 2: Monday, Sept. 10

  • Topics:
    • Logic and proofs
  • Reading
    • 1.3 - 1.5, skipping 1.6 and 1.7 (but please read them over)

Monday:

  • Predicate logic (1.3)
  • Quantifiers
  • Connections with database systems

Tuesday:

  • Prolog  demo
  • Nested quantifiers (1.4)

 

Thursday:

  • Rules of inference (1.5)

Friday:

  • Rules of inference (1.5)
  • Methods of proofs (1.6, 1.7 briefly)

Other Notes:

  • Office hours resume this week.
  • The last day to drop without record is next Monday.

 

Week 3: Monday, Sept. 17

  • Topics:
    • Introduction to set theory
  • Reading
    • 2.1 - 2.3

Monday:

  • Methods of proofs (1.6, 1.7 briefly): Assuming the contrary
  • Introduction to set theory (2.1 - 2.2)
  • Last day to drop without record

Tuesday:

  • Set operations (2.2)
  • No office hours today (dental appointment)

Thursday:

  • HW 1 returned
  • Problem session

Friday:

  • Functions  (2.3)

Other Notes:

  • The last day to drop without record is this Monday.
  • Hour Exam #1 will be next Friday

Week 4: Monday, Sept. 24

  • Topics:
    • Algorithms
    • First Hour Exam (Friday)
  • Reading
    • 2.4, 3.1

Monday:

  • Some important functions (briefly)
  • Sequences and summations (2.4)

Tuesday:

  • Sequences and summations (2.4)
  • Introduction to Mathematical Induction (covered in more detail in 4.1)
  • No office hours today (another dental appointment)

Thursday:

  • An introduction to algorithms
  • Review for hour exam #1

Friday:

  • Hour Exam #1

Other Notes:

  • Hour Exam #1 is this Friday

 

Week 5: Monday, Oct. 1

  • Topics:
    • Algorithms
  • Reading
    • 3.1 - 3.2

Monday:

  • Exam returned and discussed

Tuesday:

  • An introduction to algorithms (continued) (3.1)
  • The growth of functions: big-O (3.2)

Thursday:

  • The growth of functions: big-O (3.2)

Friday:

  • Comparison of big-O reference functions (Mathematica session)

 

Other Notes:

  • The next hour exam is Friday, October 26

Week 6: Monday, Oct. 8

  • Topics:
    • Algorithms
    • Integers and data representation
    • Induction
  • Reading
    • 3.3 - 3.6, skipping 3.7,4.2, and (probably) 4.5

Monday:

  • Complexity of algorithms (3.3)

Tuesday:

  • Some properties of integers (3.4, 3.5, briefly)

Thursday:

  • Some properties of integers (3.4, 3.5, briefly)

Friday:

  • Integers and Algorithms (3.6)
    • Bits, Nybbles, and Bytes:  The computer representation of numbers
  • We will skip 3.7

Other Notes:

  • The next hour exam is Friday, October 26

Week 7: Monday, Oct. 15

  • Topics:
    • Induction
    • Recursive Algorithms
  • Reading
    • 3.8 -  4.4

Monday:

  • Binary arithmetic, representation of integers
  • The second hour exam will cover through this material (homework assignment)

Tuesday:

  • Matrices (3.8)
  • No office hours today (dentist appointment)

Thursday:

  • Mathematical Induction (4.1)

Friday:

  • Recursive Algorithms (4.4) (Lisp demo)

Other Notes:

  • Monday is the last day to drop with an automatic 'W'
  • Monday and Tuesday of next week (October 22 - 23) is Fall Break (no classes or office hours)
  • The next hour exam is next Friday, October 26

Week 8: Monday, Oct. 22

  • Topics:
    • Recursion and induction
  • Reading
    • 4.3 -  5.1, skipping 4.2

Monday:

  • Fall Break (no classes or office hours)

Tuesday:

  • Fall Break (no classes or office hours)

Thursday:

  • Recursive Definitions and Structural Induction (4.3) (skipping 4.2)
  • Review for second hour exam

Friday:

  • Hour Exam #2

Other Notes:

  • Hour Exam #2 is this Friday
  • Monday and Tuesday of this week (October 22 - 23) is Fall Break (no classes or office hours)

Week 9: Monday, Oct. 29

  • Topics:
    • Counting
  • Reading
    • 5.1 -  5.4, skipping 5.5 and 5.6

Monday:

  • Counting basics (5.1)
  • The pigeonhole principle (5.2)

Tuesday:

  • The pigeonhole principle (5.2)

Thursday:

  • Permutations and combinations (5.3)

Friday:

  • Permutations and combinations (5.3)
  • Binomial Coefficients (5.4)

Other Notes:

  • We will skip chapter 7
  • The next hour exam will be Friday, November 16

Week 10: Monday, Nov. 5

  • Topics:
    • Discrete probability
  • Reading
    • 5.4, 6.1 -  6.3

Monday:

  • Binomial Theorem (5.4)

Tuesday:

  • Binomial Theorem (5.4)

Thursday:

  • Introduction to discrete probability (6.1)

Friday:

  • Discrete probability (6.2)

Other Notes:

  • We will skip chapter 7 and resume with chapter 8 (relations)
  • The next hour exam will be next Friday, November 16

Week 11: Monday, Nov. 12

  • Topics:
    • Discrete probability
  • Reading
    • 6.2

Monday:

  • Homework questions
  • Conditional probability

Tuesday:

  • Homework questions
  • Conditional probability

Thursday:

  • Review for the third hour exam

Friday:

  • Third Hour Exam
    •

Other Notes:

  • We will skip chapter 7 and resume with chapter 8 (relations)
  • We will cover sections 8.1 - 8.3, and 8.5 of chapter 8
  • The next hour exam will be this Friday, November 16
  • Thursday and Friday of next week is Thanksgiving Break (no classes or office hours)

Week 12: Monday, Nov. 19

  • Topics:
    • Discrete probability
    • Relations
  • Reading
    • 6.3 (skipping 6.4 and chapter 7), 8.1, 8.2, 8.5 (skipping 8.4 and 8.6)

Monday:

  • Bayes's Theorem and an application to expert systems (A very quick note -6.3)
  • Relations and their properties (8.1)
  • n-ary relations and their applications (particularly to relational database systems - 8.2)

Tuesday:

  • n-ary relations and their applications (particularly to relational database systems - 8.2)
  • Equivalence relations (8.5)
  • Return of Exam #3

Thursday:

  • Thanksgiving Break (no classes or office hours)

Friday:

  • Thanksgiving Break (no classes or office hours)

Other Notes:

  • We will begin chapter 9 Monday after the break.
  • Exam #4 will be Friday,   December 7.  Please note that this is in the last full week of the term.

Week 13: Monday, Nov. 26

  • Topics:
    • Graph Theory
  • Reading
    • 9.1 - 9.4

Monday:

  • Equivalence relations (8.5)
  • Introduction to graph theory (9.1)

Tuesday:

  • Graph terminology (9.2)

Thursday:

  • Representation of graphs (9.3)
  • Graph isomorphism (9.3)

Friday:

  • Connectivity (9.4)

Other Notes:

  • Exam #4 will be next  Friday,   December 7.  Please note that this is in the last full week of the term.

Week 14: Monday, Dec. 3

  • Topics:
    • Graph Theory
  • Reading
    • 9.5 - 9.6, 10.1, skipping 9.7, 9.8)

Monday:

  • Euler and Hamilton Paths (9.5)

Tuesday:

  • Shortest Path Problems (9.6)

Thursday:

  • Review for exam #4

Friday:

  • Hour Exam #4

Other Notes:

  • Exam #4 will be Friday,   December 7.  Please note that this is in the last full week of the term.
  • Next Thursday and Friday are Reading Period (no classes, but office hours as usual)
  • Math 210 has a final exam scheduled for Friday, Dec. 21, from 12:00 - 2:00.  In lieu of the final exam we will have a final problem set assigned on the last day of class, due by the time of the final exam, and having the weight of one hour exam.

 

Return to Course Home Page