CS 131 SP17 Schedule

	A	B	C	D	E	F	H	I	J
1							ASSIGNED READING:	RECOMMENDED READING:	OPTIONAL READING:
2	1	R	1/19/2017	Intro to Class
3	2	T	1/24/2017	Propositional Logic			Rosen 1.1	Velleman 1.2, 1.5	Rosen 1.2
4	3	R	1/26/2017	Propositional Logic	HW0 due (Monday 30)		Rosen 1.3	Velleman 1.5
5	4	T	1/31/2017	Logic and Set Theory			Rosen 2,2.1	Velleman 1.3, 1.4
6	5	R	2/2/2017	Quantifiers	HW1 due		Rosen 1.4	Velleman 2.1-2.3
7	6	T	2/7/2017	Quantifiers			Rosen 1.5
8	x	R	2/9/2017	SNOW DAY	HW2 due
9	7	T	2/14/2017	Rules of Inference			Rosen 1.6
10	M	R	2/16/2017	MIDTERM 1	no HW
11	NO CLASS	T	2/21/2017
12	8	R	2/23/2017	Rules of Inference	HW3 due	DROP WITH NO W	Rosen 1.6
13	9	T	2/28/2017	Proof strategies			Rosen 1.7,1.8	Velleman 3.1-3.7
14	10	R	3/2/2017	Proof strategies	HW4 due		Rosen 1.7,1.8	Velleman 3.1-3.8
15	NO CLASS	T	3/7/2017
16	NO CLASS	R	3/9/2017
17	x	T	3/14/2017	SNOW DAY
18	11	R	3/16/2017	Induction	HW5 due		Rosen 2.4, 5.1
19	12	T	3/21/2017	Induction			Rosen 5.1,
20	13	R	3/23/2017	Strong Induction	HW6 due		Rosen 5.2
21	M	T	3/28/2017	MIDTERM 2
22	14	R	3/30/2017	Exam Post-mortem		DROP WITH W: 3/31
23	15	T	4/4/2017	More Strong Induction - Introduction to Linear Recurrences			Rosen 5.2. 5.3 up to p.347
24	16	R	4/6/2017	Recurrence Relations	HW7 due		Rosen 8.1, MIT Notes 10.1
25	17	T	4/11/2017	Recurrence Relations			Rosen 8.1, MIT Notes 10.2
26	18	R	4/13/2017	CANCELLED - see videos - O notation	HW8 due		Rosen 3.2
27	19	T	4/18/2017	Recursive Algorithms - Master Theorem			Rosen 8.3	MIT Notes 9.7
28	20	R	4/20/2017	Master Theorem		no lab 4/19	Rosen 8.3	MIT Notes 10.4
29	21	T	4/25/2017	Solving linear recurrence relations			Rosen 8.2	MIT Notes 10.3.1, 10.3.2
30	22	R	4/27/2017	Counting	HW9 due		Rosen 6.1, 6.3	MIT 11.1-11.6
31	23	T	5/2/2017	Counting			Rosen 6.4, 6.5	MIT 11.1-11.6
32					HW10 due
33
34
35	FINAL	?	?
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100