MCS 261: Discrete Mathematics Syllabus

The information on this and related pages applies only to Prof. Zhao's lecture of MCS 261.

This outline is tentative and subject to change.

Week

Date

Sections for Discussion

Topics

1

1/13 – 1/18

1.1 - 1.2

Compound Statements, Proofs

2

1/20

1/22

1/24

Holiday
1.3
1.4

Holiday
Truth Tables
Propositions

3

1/27 – 29

1/31

1.4, 1.5

2.1

Propositions, Logical Arguments

Sets

4

2/3-2/8

2.2 – 2.4

Sets and Relations

5

2/10 – 2/14

2.4
3.1 - 3.2

Equivalence Relations
Functions and Inverse Functions

6

2/17 – 2/19

2/21

3.3
Hour Exam I

Cardinality of a Set
Friday, February 21

7

2/24 – 2/28

5.1 – 5.2

Mathematical Induction

8

3/3

3/5, 3/7

5.3,

6.1, 6.2

Recursion
Principles of Counting

9

3/10 – 3/12

3/14

6.3

7.1

Pigeonhole Principle

Permutations

 

3/17 –3/21

Spring Break

No Classes

10

3/24 - 3/28

7.2, 7.3, 7.5

Combinations, Repetitions and

Binomial Theorem

11

3/31

4/2

4/4

8.1

8.2

Hour Exam II

Algorithms

Complexity

Friday, April 4

12

4/7 - 4/11

9.1 - 9.3

 

Graphs

13

4/14 - 4/18

10.1

10.2

Eulerian Circuits

Hamiltonian Cycles

14

4/21 – 4/25

12.1, 12.2

Trees

15

4/28 – 5/2

14.1

 

Planar Graphs, Review

 

Return to the Discrete Mathematics main page.