Tentative Course schedule

	A	B	C	D	E	F	G
1	Date	Topic	Details	Events	Assignment	Bonus	Attendance
2	8/22	Introduction	Problems that should be easy for CP grads, hard for others	Introductory Contest	100	50	45
3	8/29	Data Structure and search	Segment Tree, Fenwick Tree, Trie		100	50	45
4	9/5	Dynamic Programming 1			100	50	45
5	9/12	Dynamic Programming 2			100	50	45
6	9/19	DP 3 Case study	Stock problem; Tree DP; State Compression DP		100	50	45
7	9/26	REVISION WEEK	Office hours	Extra credit for missed problems		250
8	10/3	CONTEST DAY	Mid semester contest		100	50	45
9	10/10	Graphs 1	Shorest path, Spanning tree		100	50	45
10	10/17	Graphs 2	SCC, Max flow		100	50	45
11	10/24	Computational Geometry			100	50	45
12	10/31	Final Contest Day		Contest for students within CP2.	100	50	95
13		REVISION WEEK	Office hours	Extra credit for missed problems		250
14
15	-----------
16
17
18			Total Assignment Points	1000
19			Total Attendace Points	500
20
21			Total possible points for grade	1500
22			Total Bonus Points	1000
23
24
25
26
27
28
29
30
31
32
33
34
35
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