Previous Weeks in the Math 211 Course

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

Week 1: Monday, August 29

• Topics:
• Introduction
• Reading:  1.1 - 1.5

Monday:

• Introduction to the course
• Some logical basics:  Propositional logic
• Truth tables

Tuesday:

• Material implication
• Tautologies and rules
• Predicate logic (an introduction)
• Assignment #1 assigned

Wednesday:

• Rules of negation in predicate logic
• An application to database systems

Friday:

• Methods of proofs
• Rules for reasoning
• Resolution theorem proving
• Assignment #1 collected
• Assignment #2 assigned

Other Notes:

• Next Monday is Labor Day (no classes or office hours)

Week 2: Monday, September 5

• Topics:
• Sets and functions
• Reading::  1.5 - 1.7

Monday:

• Labor Day (no classes or office hours)

Tuesday:

• Rules of inference for quantified statements
• Methods of proof (a survey)

Wednesday:

• Methods of proofs, continued
• Set Theory:  basics
• Problem set #3 assigned

Friday:

• Set operations

Other Notes:

• No class next Friday (Instructor out of town)

Week 3: Monday, September 12

• Topics:
• Analysis of algorithms
• Reading::  1.8 - 2.2

Monday:

• Functions and the like
• Problem set #2 returned
• Problem set #4 assigned

Tuesday:

• Algorithms
• Growth of functions

Wednesday:

• Set algebra, predicate logic, and SQL
• Problem set #5 assigned

Friday:

• Instructor out of town (no classes or office hours)

Other Notes:

• Monday, September 12 is the last day to drop without record.
• The first hour exam will be next Friday

Week 4: Monday, September 19

• Topics:
• Algorithms
• Matrices
• Reading::  2.4 - 2.7, skipping 2.6

Monday:

• Complexity (2.3)
• Problem set #4 collected

Tuesday:

• Complexity
• Some basic number theory (2.4, 2.5)
• Problem set #5 collected

Wednesday:

• A bit of Prolog
• Review for exam #1

Friday:

• Exam #1

Other Notes:

Week 5: Monday, September 26

• Topics:
• Number Theory
• Reading::  2.7 - 3.4

Monday:

• Some basic number theory (2.4)

Tuesday:

• Congruence classes: modular arithmetic(2.4)
• Exam #1 returned

Wednesday:

• Representation of integers (2.5)
• A bit of Lisp

Friday:

• Representation of integers (2.5)
• Integer arithmetic

Other Notes:

• Monday, September 26, is the last day to withdraw with an automatic 'W'

Week 6: Monday, Oct. 3

• Topics:
• Matrices
• Recursion and Induction
• Reading:: 2.7 - 3.4

Monday:

• Matrices (2.7)

Tuesday:

• Sequences (3.2) (skip 3.1)
• Cardinality

Wednesday:

• Cardinality
• Mathematical Induction (3.3)

Friday:

• Recursion 3.4 - 3.5
• Recursive algorithms

Other Notes:

• The second hour exam will be next Friday

Week 7: Monday, Oct. 10

• Topics:
• Recursion
• Proof of correctness
• Basic counting
• Reading:: 3.5 - 4.2

Monday:

• Recursive algorithms (3.4 - 3.5)
• Basic counting (4.1)

Tuesday:

• Basic counting (4.1)
• Pigeonhole Principle (4.2)

Wednesday:

• The Pigeonhole Principle (4.2)
• Review for exam #2

Friday:

• Exam #2

Other Notes:

• Monday, Oct. 17, is Fall Break Day (no classes or office hours)

Week 8: Monday, Oct. 17

• Topics:
Basic counting
• Reading:: 4.3 - 4.5, skipping 4.6,

Monday:

• Fall Break Day - No classes or office hours

Tuesday:

• Permutations and combinations (4.3)
• Return of exam #2

Wednesday:

• Binomial Coefficients (4.4)

Friday:

• Generalized permutations and combinations (4.5)

Other Notes:

Week 9: Monday, Oct. 24

• Topics:
• Discrete Probability
• Reading:: 4.2 - 4.3

Monday:

• Introduction (5.1)

Tuesday:

• Introduction (5.1)
• Probability (5.2)

Wednesday:

• Probability (5.2)

Friday:

• Expected values and variance (5.3)

Other Notes:

• The third hour exam will be next Friday (Nov. 4) (this was changed 10/30/05 to the following Friday, Nov. 11)

Week 10: Monday, Oct. 31

• Topics:
• Discrete Probability
• Reading:: 6.1, 6.3, 7.1

Monday:

• Recurrence Relations (6.1) (6.2 if time permits)

Tuesday:

• Divide-and-conquer algorithms (6.3)

Wednesday:

• Divide-and-conquer algorithms (6.3)

Friday:

• Relations and their properties (7.1 - 7.2)

Other Notes:

• We will cover 7.1 - 7.2, 7.4 - 7.5 of chapter 7
• Exam #3 has been moved to Friday, November 11 (next Friday)

Week 11: Monday, Nov. 7

• Topics:
• Relations and relational databases
• Reading::
;
• 7.5

Monday:

• Relations in the database context

Tuesday:

• Relational Algebra
• Select
• Project
• Join
• DivideBy (definitions and examples)
• The connection between SQL and the relational algebra
• Equivalence relations (7.5)

Wednesday:

• Geometric Distributions (problem set)
• Review for exam #3

Friday:

• Exam #3 (note change in date)

Other Notes:

• Exam #3 has been rescheduled for this Friday

Week 12: Monday, Nov. 14

• Topics:
• Graph Theory
• Reading
• Chapter 8.1 - 8.5 (as time permits)

Monday:

• Introduction to graph theory (8.1 - 8.2)
• Properties of graphs (8.3, 8.4)

Tuesday:

• Properties of graphs (8.3 - 8.4)

Wednesday:

• Properties of graphs (8.3 - 8.4)

Friday:

• Connectedness
• Discussion of exam

Other Notes:

• Wednesday of next week will be a regular class day.