CIS121 Spring 2012
Lectures (subject to change)
| Date | Description | Reading | Slides | Code / Notes |
|---|---|---|---|---|
| Jan 12 | Welcome, review of Java basics | pp.1-41 (Sec. 1.1 stop at Standard drawing) |
Person.java Address.java |
|
| Jan 17 Jan 19 |
Review of object-oriented design | pp.64-109 (Sec. 1.2) |
Checkers: Javadoc,
code Comics: Javadoc, code |
|
| Jan 24 Jan 26 |
Analysis of algorithms Javadoc |
pp. 172-196 (Sec. 1.4, stop at Coping wiht dependence on inputs) |
gcdCalculator.java | |
| Jan 31 Feb 2 |
Asymptotic notation and analysis UNIX |
no reading from the book UNIX tutorials |
||
| Feb 7 Feb 9 |
Recurrences | pp. 49-53 (3rd ed. of the book) |
||
| Feb 14 | Stacks, queues | pp. 121-171 (Sec 1.4) | none |
Shunting yard: Javadoc, code |
| Feb 16 | Searching | 3.1 and 3.2 | guest lecture by Prof. Daniilidis | |
| Feb 21 | Wrap-up / review | |||
| Feb 23 | Midterm 1 (100 Towne and 116 Fagin) | |||
| Feb 28 | Databases | no reading from the book | code | |
| Mar 1 Mar 13 |
Sorting Heaps |
2.1, 2.2, 2.4 | ||
| Mar 15 Mar 20 |
Balanced Trees | 3.3 | guest lectures by Prof. Daniilidis | |
| Mar 22 | Hash tables | 3.4 | SetAndMapDemo.java | |
| Mar 27 | Wrap-up / review | |||
| Mar 29 | Midterm 2 (100 Towne and 116 Fagin) | |||
| Apr 3 Apr 5 |
Undirected graphs, BFS / DFS, shortest paths in weighted graphs |
Sec. 4.1, 4.4 | ||
| Apr 10 Apr 12 |
Directed graphs, topological sort, strongly connected components |
Sec. 4.2, 4.4 | ||
| Apr 17 | Minimum spanning trees | Sec. 1.5 Sec. 4.3 |
pdf (Union-Find) pdf (Kruskal's algorithm) |
guest lecture by Prof. Daniilidis |
| Apr 19 | Minimum spanning trees, transitive closure |
Sec 4.3 | ||
| Apr 24 | Wrap-up / review | mock exam | ||
| May 3 | Final exam |