CS 2022/MA 2201 Term A 2002 Schedule

Warning: This schedule is subject to revision!

Readings are from Rosen, Discrete Mathematics and its Appplications and should be completed before the class indicated.

Homework assignments are from Rosen, Discrete Mathematics and its Appplications and should be completed after the class indicated.

Date Meeting Reading Topic Homework

R Aug. 22 Lecture 1 1.1 Logic I 1.1: 1, 8, 12, 21, 35, 40
F 23 Lecture 2 1.2-1.3 Logic II 1.2: 9, 24, 27, 34b; 1.3:6ac, 9a, 12d, 24a, 44a
M 26 Lecture 3 1.4-1.5 Sets 1.4: 1, 15b, 23, 26; 1.5: 4, 25, 47a
T 27 Lecture 4 1.6 Functions 1.6: 3, 8, 9, 15, 21, 22, 29, 59
W 28 Tutorial
R 29 Lecture 5 1.7 Sequences 1.7: 2, 10, 11, 27, 28, 31, 41
F 30 Lecture 6 1.8 Growth 1.7: 42, 43; 1.8: 7, 20, 39, 51b
M Sep. 2 Labor Day -- No Classes
T 3 Lecture 7 2.1-2.2 Complexity 2.1: 4, 19; 2.2: 6, 7, 8, 9
W 4 Tutorial
R 5 Lecture 8 2.3, 2.5 Integers 2.3: 14, 21, 33; 2.5: 12, 17
F 6 Lecture 9 3.1 Proofs 3.1: 16, 23, 31, 42, 49
M 9 Examination 1
T 10 Lecture 10 3.2 Induction 3.2: 2, 6, 34, 47
W 11 Tutorial
R 12 Lecture 11 Handout Groups Handout problems
F 13 Lecture 12 4.1 Counting 4.1: 3, 12, 32, 34, 46
M 16 Lecture 13 4.2-4.3 Permutations 4.2: 5, 8, 13; 4.3: 4, 16, 32
T 17 Lecture 14 4.4, 4.6 Discrete Probability 4.4: 1, 6, 23; 4.6: 3, 8, 32
W 18 Tutorial
R 19 Lecture 15 5.1 Recurrence Relations 5.1: 4, 17, 23, 29, 31
F 20 Lecture 16 5.2 Solving Recurrences 5.2: 3abc, 5, 28, 39a
M 23 Lecture 17 5.3, 5.5 Divide & Conquer 5.3: 14, 15, 17; 5.5: 1, 12, 17
T 24 Lecture 18 6.1-6.2 Relations 6.1: 1, 5, 10, 14, 20, 25; 6.2:1
W 25 Tutorial
R 26 Examination 2
F 27 Lecture 19 6.3 Representing Relations 6.1: 30; 6.3: 2, 3, 4, 10ab, 17
M 30 Lecture 20 6.4 Closures 6.4: 3, 4, 17, 19f, 23, 24
T Oct. 1 Lecture 21 6.5 Equivalences 6.5: 3, 5, 8, 14, 26, 37, 38
W 2 Tutorial
R 3 Lecture 22 6.6 Partial Orders 6.6: 1, 2, 10, 16, 20, 32a
F 4 Lecture 23 7.1-7.2 Graphs 7.2: 1, 4, 5, 14, 21, 27
M 7 Lecture 24 7.3-7.4 Isomorphisms 7.3: 5, 11, 38, 45, 60; 7.4: 1, 12
T 8 Lecture 25 7.5, 7.7 Paths & Planarity 7.5: 16, 22, 57; 7.7: 9, 34
W 9 Tutorial
R 10 Examination 3

Date	Meeting	Reading	Topic	Homework
R	Aug.	22	Lecture 1	1.1	Logic I	1.1: 1, 8, 12, 21, 35, 40
F		23	Lecture 2	1.2-1.3	Logic II	1.2: 9, 24, 27, 34b; 1.3:6ac, 9a, 12d, 24a, 44a
M		26	Lecture 3	1.4-1.5	Sets	1.4: 1, 15b, 23, 26; 1.5: 4, 25, 47a
T		27	Lecture 4	1.6	Functions	1.6: 3, 8, 9, 15, 21, 22, 29, 59
W		28	Tutorial
R		29	Lecture 5	1.7	Sequences	1.7: 2, 10, 11, 27, 28, 31, 41
F		30	Lecture 6	1.8	Growth	1.7: 42, 43; 1.8: 7, 20, 39, 51b
M	Sep.	2	Labor Day -- No Classes
T		3	Lecture 7	2.1-2.2	Complexity	2.1: 4, 19; 2.2: 6, 7, 8, 9
W		4	Tutorial
R		5	Lecture 8	2.3, 2.5	Integers	2.3: 14, 21, 33; 2.5: 12, 17
F		6	Lecture 9	3.1	Proofs	3.1: 16, 23, 31, 42, 49
M		9	Examination 1
T		10	Lecture 10	3.2	Induction	3.2: 2, 6, 34, 47
W		11	Tutorial
R		12	Lecture 11	Handout	Groups	Handout problems
F		13	Lecture 12	4.1	Counting	4.1: 3, 12, 32, 34, 46
M		16	Lecture 13	4.2-4.3	Permutations	4.2: 5, 8, 13; 4.3: 4, 16, 32
T		17	Lecture 14	4.4, 4.6	Discrete Probability	4.4: 1, 6, 23; 4.6: 3, 8, 32
W		18	Tutorial
R		19	Lecture 15	5.1	Recurrence Relations	5.1: 4, 17, 23, 29, 31
F		20	Lecture 16	5.2	Solving Recurrences	5.2: 3abc, 5, 28, 39a
M		23	Lecture 17	5.3, 5.5	Divide & Conquer	5.3: 14, 15, 17; 5.5: 1, 12, 17
T		24	Lecture 18	6.1-6.2	Relations	6.1: 1, 5, 10, 14, 20, 25; 6.2:1
W		25	Tutorial
R		26	Examination 2
F		27	Lecture 19	6.3	Representing Relations	6.1: 30; 6.3: 2, 3, 4, 10ab, 17
M		30	Lecture 20	6.4	Closures	6.4: 3, 4, 17, 19f, 23, 24
T	Oct.	1	Lecture 21	6.5	Equivalences	6.5: 3, 5, 8, 14, 26, 37, 38
W		2	Tutorial
R		3	Lecture 22	6.6	Partial Orders	6.6: 1, 2, 10, 16, 20, 32a
F		4	Lecture 23	7.1-7.2	Graphs	7.2: 1, 4, 5, 14, 21, 27
M		7	Lecture 24	7.3-7.4	Isomorphisms	7.3: 5, 11, 38, 45, 60; 7.4: 1, 12
T		8	Lecture 25	7.5, 7.7	Paths & Planarity	7.5: 16, 22, 57; 7.7: 9, 34
W		9	Tutorial
R		10	Examination 3

CS 2022 Home Page

[CS] WPI CS Home Page

[WPI] WPI Home Page