Week 1: Monday, Aug. 28

• Topics:
• Introduction  
• Reading
• Chapter 1

Monday:

• Introduction to the course

Wednesday:

• Basic propositional logic and truth tables (1.1, 1.2)
• Connections with digital circuits

Thursday:

• More on propositional logic (tautologies)
• Predicate logic(1.3, 1.4)

Friday:

• Predicate logic
• Connections with database systems
• Some Prolog

Other Notes:

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

Week 2: Monday, Sept. 4

• Topics:
• Finish Chapter 1
• Sets, functions, etc.
• Reading
• 2.1 - 2.2

Monday:

• Labor Day (no classes or office hours)

Wednesday:

• Continued discussion on predicate logic and connections with computer science.
• Prolog and SQL demos

Thursday:

• Rules of inference
• Resolution theorem proving

Friday:

• Three varieties of proofs (two examples)
• Introduction to set theory

Other Notes:

• Monday is Labor Day:  No classes or office hours

Week 3: Monday, Sept. 11

• Topics:
• Finish Chapter 2
• Algorithms
• Reading
• 3.1 - 3.5

Monday:

• Functions and relations:  Why is a relational database system called relational? (2.3)
• Monday is the last day to drop without record

Wednesday:

• Kinds of functions
• Operations on functions
• Counting using bijections

Thursday:

• Sequences and summations (2.4)
• Matrices (a bit out of order, as it turns out)

Friday:

• Algorithms (3.1)

Other Notes:

• Monday, September 11, is the last day to drop without record.  Please review the revised policy on course withdrawals in the Student Handbook
• The first hour exam will be next Friday.

Week 4: Monday, Sept. 18

• Topics:
• Finish Chapter 3
• Induction and recursion
• Reading
• 3.2  - 3.5 (as time permits)
• 4.1

Monday:

• We viewed the film "Sorting out Sorting"

Wednesday:

• Algorithm Complexity (3.2):  Big-O, Big-Ω, Big-Θ
• Linear search

Thursday:

• Properties of asymptotic behavior.
• Review for hour exam #1

Friday:

• Hour Exam #1

Other Notes:

• The first hour exam will be this Friday.
• Please note: My office will change to Temporary Building E10 on Oct. 1 or shortly thereafter.

Week 5: Monday, Sept. 25

• Topics:
• Induction and recursion
• Reading
• Skip 3.4, 3.5 except for definition of division)
• 3.6 (for representation of integers)
• Read 3.7 (but we'll skip it for now)
• 3.8 has already been covered (but read over it - we'll have some problems assigned)..
• 4.1

Monday:

• Searching and sorting (3.3)

Wednesday:

• Sorting briefly discussed
• Final discussion on computational complexity (at least, until 361 and 370):  tractable and intractable problems (3.3)

Thursday:

• Binary Representation of integers (3.6)

Friday:

• Binary arithmetic (3.6)

Other Notes:

• Please note: My office will change to Temporary Building E10 some time next week.  It may not be possible for me to be at all office hours until the move is completed.

Week 6: Monday, October 2

• Topics:
• Finish Chapter 4 (induction and recursion)
• Start chapter 5 (counting)
• Reading
• Chapter 5

Monday:

• Representation of integers

Wednesday:

• Mathematical induction (4.1)
• Strong induction and well-ordering (4.2)
• How induction works

Thursday:

• Recursive definitions (4.3)

Friday:

• Recursive algorithms

Other Notes:

• Please note: My office will change to Temporary Building E10 some time this week.  It may not be possible for me to be at all office hours until the move is completed.
(We didn't actually move this week.  The move is scheduled for next week.)
• There will be no class or office hours next Wednesday (Oct. 11)

Week 7: Monday, October 9