instructor:
Dave Kauchak
e-mail: David.last_name@pomona.edu
TBA
and by appointment
class time: T/Th 12:45-2pm
lab time: W 12:45-3:45pm
web page: http://www.cs.pomona.edu/classes/cs62/
Other information:
| Date | Topic | Readings | Assignment |
|---|---|---|---|
| 1/26 | Java basics | datatypes, operators (5 pgs), control (7 pgs) | |
| 1/27 | Introduction | Java Practice | |
| 1/28 | classes | arrays, classes, objects | |
| 2/2 | more java | ||
| 2/3 | multiple classes | Flippy Card | |
| 2/4 | inheritance | ||
| 2/9 | file I/O, exceptions | exceptions | |
| 2/10 | Debugger | Darwin (2 weeks) | |
| 2/11 | big O | ||
| 2/16 | more big O | ||
| 2/17 | Timing Arraylists, slides (ppt) | ||
| 2/18 | singly linked lists, slides (ppt) | ||
| 2/23 | doubly linked lists, slides (ppt) | ||
| 2/24 | JUnit | Text Calculator | |
| 2/25 | stacks and queues | ||
| 3/2 | midterm review | sample problems (solutions) | |
| 3/3 | Midterm 1 | ||
| 3/4 | hashtables (ppt) | ||
| 3/9 | BREAK | ||
| 3/10 | BREAK | ||
| 3/11 | BREAK | ||
| 3/16 | hashtables 2 (ppt) | ||
| 3/17 | Midterm 1 recap | Compressions (2 weeks) | |
| 3/18 | sorting fundamentals (ppt) | ||
| 3/23 | mergesort (ppt) | ||
| 3/24 | |||
| 3/25 | quicksort (ppt) | ||
| 3/30 | comparators and iterators (ppt) | ||
| 3/31 | Timing sorting | On-disk Sort | |
| 4/1 | binary trees (ppt) | ||
| 4/6 | heaps (ppt) | ||
| 4/7 | git | Autocomplete | |
| 4/8 | heapsort + priority queues (ppt) | ||
| 4/13 | binary search trees (ppt) | ||
| 4/14 | Hex-A-Pawn | ||
| 4/15 | graphs (ppt) | ||
| 4/20 | graph representations, midterm 2 review | sample problems | |
| 4/21 | Midterm 2 | Text Generator | |
| 4/22 | graph search (ppt) | ||
| 4/27 | search continued (ppt) | ||
| 4/28 | Midterm recap | Maps (due Friday, 5/7) | |
| 4/29 | shortest paths (ppt) | ||
| 5/4 | balanced trees (ppt) | ||
| 5/5 | Ethics | ||
| 5/6 | review | sample problems |
Final exam: Wednesday, 5/12, 2-5pm (PST) -- or asynchronously some time that day with permission.
Additional resources