-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathindex.html
298 lines (298 loc) · 8.07 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
<!DOCTYPE html>
<html xmlns="http://www.w3.org/1999/xhtml" lang="" xml:lang="">
<head>
<meta charset="utf-8" />
<meta name="generator" content="pandoc" />
<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes" />
<title>CS4102 - Algorithms</title>
<style>
code{white-space: pre-wrap;}
span.smallcaps{font-variant: small-caps;}
span.underline{text-decoration: underline;}
div.column{display: inline-block; vertical-align: top; width: 50%;}
div.hanging-indent{margin-left: 1.5em; text-indent: -1.5em;}
ul.task-list{list-style: none;}
.display.math{display: block; text-align: center; margin: 0.5rem auto;}
</style>
<link rel="stylesheet" href="../markdown.css" />
<!--[if lt IE 9]>
<script src="//cdnjs.cloudflare.com/ajax/libs/html5shiv/3.7.3/html5shiv-printshiv.min.js"></script>
<![endif]-->
</head>
<body>
<h1 id="cs4102---algorithms">CS4102 - Algorithms</h1>
<p><a href="../readme.html">Back to Main Page</a></p>
<p><a href="./dailyannouncements_mf.pptx">Daily Announcement Slides</a></p>
<h2 id="schedule-and-slides"><a name="introduction"></a>Schedule and Slides</h2>
<table>
<colgroup>
<col style="width: 2%" />
<col style="width: 10%" />
<col style="width: 21%" />
<col style="width: 23%" />
<col style="width: 17%" />
<col style="width: 23%" />
</colgroup>
<thead>
<tr class="header">
<th>Week</th>
<th>Date</th>
<th>Module</th>
<th>Topic</th>
<th>Slides</th>
<th>Recommended Deadline</th>
</tr>
</thead>
<tbody>
<tr class="odd">
<td>1</td>
<td>Tue, Aug. 24</td>
<td>Intro to Course</td>
<td></td>
<td>[<a href="./courseintroduction.pptx">pptx</a>], <a href="./courseintroduction.pdf">[pdf]</a></td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Aug. 26</td>
<td>M1: Div. and Con. - Sorting</td>
<td>Insertion Sort, Mergesort <br/> (Readings: CLRS Ch. 2</td>
<td><a href="./sorting-intro-f21.pptx">[ppt]</a>, <a href="./sorting-intro-f21.pdf">[pdf]</a></td>
<td></td>
</tr>
<tr class="odd">
<td>2</td>
<td>Tue, Aug. 31</td>
<td></td>
<td>Quicksort <br/> (Readings: CLRS Ch. 7 thru p. 175)</td>
<td><a href="./quicksort-f21.pptx">[pptx]</a>, <a href="./quicksort-f21.pdf">[pdf]</a></td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Sep. 2</td>
<td>M2: Div. and Con. - Recurrence Relations</td>
<td>Solving Recurrences pt. 1 <br/> Readings: CLRS Ch. 4.3-4.5</td>
<td><a href="./recurrences.pptx">[pptx]</a>, [<a href="./recurrences.pdf">pdf</a>]</td>
<td></td>
</tr>
<tr class="odd">
<td>3</td>
<td>Tue, Sep. 7</td>
<td></td>
<td>Recurrence Relations pt. 2</td>
<td>Same as above</td>
<td>M1: Sorting</td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Sep. 9</td>
<td>M3: Div. and Con. - Advanced</td>
<td>Trominos and Closest Pair of Points <br/> Readings: CLRS Ch. 33.4</td>
<td><a href="./DivAndCon_Advanced_1.pptx">pptx</a>, <a href="./DivAndCon_Advanced_1.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="odd">
<td>4</td>
<td>Tue, Sep. 14</td>
<td></td>
<td>Matrix Multiply, Quickselect, Median of Medians <br/> Readings: CLRS Ch. 4.2, Ch. 9</td>
<td><a href="./DivAndCon_Advanced_2.pptx">pptx</a>, <a href="./DivAndCon_Advanced_2.pdf">pdf</a></td>
<td>M2: Recurrence Relations</td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Sep. 16</td>
<td>M4: Graphs - BFS and DFS</td>
<td>BFS <br/> Readings: CLRS 22.1-22.2</td>
<td><a href="./graphs-bfs-f21.pptx">pptx</a>, <a href="./graphs-bfs-f21.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="odd">
<td>5</td>
<td>Tue, Sep. 21</td>
<td>QUIZ ATTEMPT 1</td>
<td>* <strong><a href="../courselogistics/mods-1-2-3-topics.html">Info and topics for Quizzes 1-3</a></strong> *</td>
<td>…</td>
<td>M3: Closest Pair of Points</td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Sep. 23</td>
<td></td>
<td>DFS, Topo-sort, SCC <br/> Readings: CLRS 22.3-22.5</td>
<td><a href="./graphs-dfs-f21.pptx">[pptx]</a>, <a href="./graphs-dfs-f21.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="odd">
<td>6</td>
<td>Tue, Sep. 28</td>
<td></td>
<td>DFS, Topo-sort, SCC (cont’d)</td>
<td>Same as above</td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Sep. 30</td>
<td>M5: Graphs - Kruskal’s and Find-Union</td>
<td>Implementation of Find-Union D.S.</td>
<td><a href="./kruskal-find-union.pptx">pptx</a>, <a href="./kruskal-find-union.pdf">pdf</a></td>
<td>M4: BFS / DFS Written Problems</td>
</tr>
<tr class="odd">
<td>7</td>
<td>Tue, Oct. 5</td>
<td>M6: Graphs - Prim’s and Dijkstra’s</td>
<td>Prim,Dijkstra,Indirect Heaps</td>
<td><a href="./dijkstraAndPrim.pptx">pptx</a>, <a href="./dijkstraAndPrim.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Oct. 7</td>
<td>QUIZ RETAKES (Mod 1-3)</td>
<td>No Lecture</td>
<td>…</td>
<td>M5: Wiring</td>
</tr>
<tr class="odd">
<td>8</td>
<td>Tue, Oct. 12</td>
<td>NO CLASS: FALL BREAK</td>
<td>No Lecture</td>
<td>…</td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Oct. 14</td>
<td></td>
<td>Proving Prim’s and Dijkstra’s</td>
<td>No Slides</td>
<td></td>
</tr>
<tr class="odd">
<td>9</td>
<td>Tue, Oct. 19</td>
<td>QUIZ ATTEMPT 1 (Mod 4-5)<br/>M7: Greedy Algorithms</td>
<td>* <strong><a href="../courselogistics/mods-4-5-topics.html">Info and topics for Quizzes 4-5</a></strong> *<br/>Intro to Greedy and Coin Change<br/>(Note: Lecture Recorded)</td>
<td><a href="./GreedyAlgorithms_1.pptx">pptx</a>, <a href="./GreedyAlgorithms_1.pdf">pdf</a></td>
<td>M6: Written Graph Problems</td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Oct. 21</td>
<td></td>
<td>Knapsack Problem</td>
<td>Same as above</td>
<td></td>
</tr>
<tr class="odd">
<td>10</td>
<td>Tue, Oct. 26</td>
<td></td>
<td>Activity Selection</td>
<td>Same as above</td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Oct. 28</td>
<td>M8: Dynamic Programming</td>
<td>Intro, Rod Cutting</td>
<td><a href="./DynamicProgramming.pptx">pptx</a>, <a href="./DynamicProgramming.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="odd">
<td>11</td>
<td>Tue, Nov. 2</td>
<td></td>
<td>Activity Selection, Knapsack</td>
<td>Same as above</td>
<td>M7: Nursery</td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Nov. 4</td>
<td></td>
<td>Coin Change, Sequences</td>
<td><a href="./DP_sequences.pptx">pptx</a></td>
<td></td>
</tr>
<tr class="odd">
<td>12</td>
<td>Tue, Nov. 9</td>
<td>M9: Network Flow and Ford-Fulkerson</td>
<td>Network Flow, Ford-Fulkerson Algorithm</td>
<td>[<a href="./Network-Flow.pptx">pptx</a>] <br/> Horton’s <a href="./Network-Flow_horton-f21.pptx">pptx</a>, <a href="./Network-Flow_horton-f21.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Nov. 11</td>
<td>QUIZ RETAKES (Mod 4-5)</td>
<td>Max-Flow</td>
<td>Same as above</td>
<td></td>
</tr>
<tr class="odd">
<td>13</td>
<td>Tue, Nov. 16</td>
<td>QUIZ ATTEMPT 1 (Mod 6-8)</td>
<td>* <strong><a href="../courselogistics/mods-6-7-8-topics.html">Info and topics for Quizzes 6-8</a></strong> *<br/>Proof and Min Cut Theorem<br/>(Note: Recorded Lecture)</td>
<td><a href="./Maxcut-Minflow-f21.pptx">pptx</a>, <a href="./Maxcut-Minflow-f21.pdf">pdf</a></td>
<td>M8: Drainage</td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Nov. 18</td>
<td>M10: Bi-Partite Matching and Reductions</td>
<td>Disjoint Paths, Intro to Reductions</td>
<td><a href="./Bipartite-Reductions.pptx">pptx</a>, <a href="./Bipartite-Reductions.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="odd">
<td>14</td>
<td>Tue, Nov. 23</td>
<td></td>
<td>Bipartite Matching, Max-Flow Variations</td>
<td>Same as above</td>
<td>M9: Network Flow Written</td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Nov. 25</td>
<td>NO CLASS: THANKSGIVING BREAK</td>
<td>No Lecture</td>
<td>…</td>
<td></td>
</tr>
<tr class="odd">
<td>15</td>
<td>Tue, Nov. 30</td>
<td></td>
<td>NP-Complete (No quiz on this material)</td>
<td><a href="./npc-floryan-s21.pptx">pptx</a>, <a href="./npc-floryan-s21.pdf">pdf</a></td>
<td></td>
</tr>
<tr class="even">
<td></td>
<td>Thu, Dec. 2</td>
<td>QUIZ RETAKES (Mod 6-8)</td>
<td></td>
<td>…</td>
<td>M10: Scheduling</td>
</tr>
<tr class="odd">
<td>16</td>
<td>Tue, Dec. 7</td>
<td>QUIZ ATTEMPT 1 (Mod 9-10)</td>
<td>* <strong><a href="../courselogistics/mods-9-10-topics.html">Info and topics for Quizzes 9-10</a></strong> *</td>
<td>…</td>
<td></td>
</tr>
</tbody>
</table>
</body>
</html>