Paul Bendich

Course Information and Grading Policies

Date Section(s) Topics HW due

8/24/15 2.1-2.3, 2.5, 2.7 Basic Counting Rules, Permutations, Combinations

8/26/15 2.8-2.10 Discrete Probability, Sampling with Replacement

8/31/15 2.10, 2.11 Occupancy Problems, Multinomial Coefficients 2.1: 2, 8
2.2: 3,5
2.7: 15,16,19
2.8: 10

9/2/15 2.14, 2.19 Binomial Expansions, Piegonhole Principle

9/7/15 3.1, 3.2 Graph Theory Basics, Connectedness 2.9: 7
2.10: 22, 24
2.11: 10
2.14: 4,15,16
2.19: 9,11,20

9/9/15 3.3, 3.4 Graph Coloring, Chromatic Polynomials

9/14/15 3.4,3.5 Trees 3.1: 15,20,29
3.2: 19,20, 32
3.3: 26,27,53,54,55

9/16/15 3.6 Rooted Trees

9/21/15 FIRST MIDTERM FIRST MIDTERM
3.4: 1,2,5,21
3.5: 2,9,11,12

9/23/15 5.1 Generating Functions: Examples

9/28/15 5.2 Operating on Generating Functions
5.1: 1,3,5,9,10,13,16

9/30/15 5.3 Applications to Counting Problems

10/5/15 5.4 Binomial Theorem
5.2: 4,11,15,16
5.3: 1 (b,c,d,k,m,o), 2

10/7/15 5.5 Exponential Generating Functions

10/12/15 FALL BREAK FALL BREAK
FALL BREAK

10/14/15 6.1, 6.2 Recurrence Relations: Examples
5.4: 1, 10, 13
5.5: 1,2, 6(b,c,e,k,l), 14, 20

10/19/15 6.2 Method of Characteristic Roots
6.1: 1,5,11,16,21,27

10/21/15 6.3 Recurrences and Generating Functions

10/26/15 6.3, 6.4 Convolutions
6.2: 1, 9, 12 (a,g)
6.3: 2 (a), 9, 11, 13, 24

10/28/15 6.4 Convolutoins

11/2/15 SECOND EXAM SECOND EXAM
SECOND EXAM

11/4/15 7.1 Inclusion-Exclusion: Intro and Applications

11/9/14 7.1,7.2 Objects with Exactly m properties
7.1: 1, 5, 6, 1, 26, 37

11/11/15 10.1, 10.2 Information Transmission, Encoding/Decoding

11/16/15 10.3 Error-Correcting Codes
7.2: 1, 7, 8, 18, 20
10.2: 1, 8, 13, 14

11/18/15 10.4 Linear Codes

11/23/15 11.1, 11.2 Depth-First Search

11/25/15 THANKSGIVING BREAK THANKSGIVING BREAK
THANKSGIVING BREAK

11/30/15 11.3, 11.4 Eulerian Chains and Paths

12/2/15 11.5, 11.6 Hamiltonian Chains and Paths

Date	Section(s)	Topics	HW due
8/24/15	2.1-2.3, 2.5, 2.7	Basic Counting Rules, Permutations, Combinations
8/26/15	2.8-2.10	Discrete Probability, Sampling with Replacement
8/31/15	2.10, 2.11	Occupancy Problems, Multinomial Coefficients	2.1: 2, 8 2.2: 3,5 2.7: 15,16,19 2.8: 10
9/2/15	2.14, 2.19	Binomial Expansions, Piegonhole Principle
9/7/15	3.1, 3.2	Graph Theory Basics, Connectedness	2.9: 7 2.10: 22, 24 2.11: 10 2.14: 4,15,16 2.19: 9,11,20
9/9/15	3.3, 3.4	Graph Coloring, Chromatic Polynomials
9/14/15	3.4,3.5	Trees	3.1: 15,20,29 3.2: 19,20, 32 3.3: 26,27,53,54,55
9/16/15	3.6	Rooted Trees
9/21/15	FIRST MIDTERM	FIRST MIDTERM	3.4: 1,2,5,21 3.5: 2,9,11,12
9/23/15	5.1	Generating Functions: Examples
9/28/15	5.2	Operating on Generating Functions	5.1: 1,3,5,9,10,13,16
9/30/15	5.3	Applications to Counting Problems
10/5/15	5.4	Binomial Theorem	5.2: 4,11,15,16 5.3: 1 (b,c,d,k,m,o), 2
10/7/15	5.5	Exponential Generating Functions
10/12/15	FALL BREAK	FALL BREAK	FALL BREAK
10/14/15	6.1, 6.2	Recurrence Relations: Examples	5.4: 1, 10, 13 5.5: 1,2, 6(b,c,e,k,l), 14, 20
10/19/15	6.2	Method of Characteristic Roots	6.1: 1,5,11,16,21,27
10/21/15	6.3	Recurrences and Generating Functions
10/26/15	6.3, 6.4	Convolutions	6.2: 1, 9, 12 (a,g) 6.3: 2 (a), 9, 11, 13, 24
10/28/15	6.4	Convolutoins
11/2/15	SECOND EXAM	SECOND EXAM	SECOND EXAM
11/4/15	7.1	Inclusion-Exclusion: Intro and Applications
11/9/14	7.1,7.2	Objects with Exactly m properties	7.1: 1, 5, 6, 1, 26, 37
11/11/15	10.1, 10.2	Information Transmission, Encoding/Decoding
11/16/15	10.3	Error-Correcting Codes	7.2: 1, 7, 8, 18, 20 10.2: 1, 8, 13, 14
11/18/15	10.4	Linear Codes
11/23/15	11.1, 11.2	Depth-First Search
11/25/15	THANKSGIVING BREAK	THANKSGIVING BREAK	THANKSGIVING BREAK
11/30/15	11.3, 11.4	Eulerian Chains and Paths
12/2/15	11.5, 11.6	Hamiltonian Chains and Paths

Home