01

W 09.03

Course Overview

First Day of Class

F 09.05

1.1 Propositional Logic

Lecture Notes. sec1.1

02

M 09.08

1.2 Propositional Equivalences

Lecture Notes, sec. 2

W 09.10

1.3 Predicates and Quantifiers

F 09.12

1.4 Nested Quantifiers

Homework 01 due Fri, 9/12

03

M 09.15

1.5 Rules of Inference

W 09.17

1.6 Introduction to Proofs

F 09.19

1.7 Proof Methods and Strategy

Homework 02 due Fri, 9/19

04

M 09.22

2.1 Sets

W 09.24

2.2 Set Operations

F 09.26

2.3 Functions

Homework 03 due Fri. 9/26

M 9.28

2.4 Sequences and Summations

Homework 04 due Fri. 10/17

F 10.03

3.1 Algorithms

06

M 10.06

Fall Break

06

W 10.08

3.2 The Growth of Functions

F 10.10

3.3 Complexity of Algorithms

M 10.13

3.4 The Integers and Division

07

W 10.15

F 10.17

3.5 Primes and Greatest Common Divisors

M 10.20

3.6 Integers and Algorithms

Homework 05 due Fri. 10/24

Midterm: Tues, Nov 4

08

W 10.22

3.7 Applications of Number Theory

F 10.24

4.1 Mathematical Induction

M 10.27

4.2 Strong Induction and Well-Ordering

Homework 5a due Fri. 10/31

09

W 10.29

4.3 Recursive Definitions and Structural Induction

F 10.31

4.4 Recursive Algorithms

M 11.03

5.1 The Basics of Counting

Homework 06 due Fri. 11/07

W 11.05

5.2 The Pigeonhole Principle

F 11.07

5.3 Permutations and Combinations

Homework 07 due Fri, 11/14

11

M 11.10

7.1 Recurrence Relations

W 11.12

7.2 Solving Linear Recurrence Relations

F 11.14

7.3 Divide-and-Conquer Algorithms and Recurrence Relations

Homework 08 due Fri. 11/21

12

M 11.17

8.1 Relations and Their Properties

13

W 11.19

8.5 Equivalence Relations

F 11.21

9.1 Graphs and Graph Models

M 11.24

9.2 Graph Terminology and Special Types of Graphs

Homework 9 due Mon. 11/24

14

W 11.26

9.3 Representing Graphs and Graph Isomorphism

F 11.28

No class Friday, Nov 28 Thanksgiving Friday

Homework 10 due Fri. 12/05

M 12.01

9.4 Connectivity

15

W 12.03

9.5 Euler and Hamilton Paths

F 12.05

9.7 Planar Graphs

Homework 11 due Wed. 12/10

M 12.08

Final: TBA