Class # | Date | Topics | Slides | Projects due | Suggested reading |
Week 1: introduction to data structures; lists; unit testing; object orientation in Java |
1 | Mon 2 July 2011 | Introduction to data structures; administrivia | L1 | | |
2 | Tue 3 July 2011 | Abstraction; abstract data types; interface versus implementation; lists. | L2 | P0 | Bailey, ch. 3 |
3 | Wed 4 July 2011 | HOLIDAY | | | |
4 | Thu 5 July 2011 | Java Virtual Machine (JVM); linked lists | L3 | | Bailey, ch. 9 |
Week 2: stacks and queues; generic types in Java; algorithmic complexity analysis |
5 | Mon 9 July 2011 | More on linked lists. | L4 | | Bailey, ch. 8 |
6 | Tue 10 July 2011 | | L5 | | Bracha: Generics in the Java Programming Language, sections 1-5. |
7 | Wed 11 July 2011 | Object-orientation in Java (interfaces, classes, abstract classes, inner classes, anonymous classes) | L6 | | Oracle docs on casting; Bailey, ch. 4 |
8 | Thu 12 July 2011 | Type-safety, Java Generics | | P1 (extended to Sunday, July 15) | |
Week 3: heaps; trees; recursive data structures |
9 | Mon 16 July 2011 | Stacks and queues | L7 | | Bailey, ch. 10 |
10 | Tue 17 July 2011 | Midterm examination (in class) -- MAKE SURE YOU BRING YOUR STUDENT ID WITH YOU. | | | |
11 | Wed 18 July 2011 | Algorithmic analysis | L8 | | |
12 | Thu 19 July 2011 | More on algorithmic analysis; compareTo | L9 | | Bailey, ch. 11 |
Week 4: binary search trees; AVL trees; hash tables; caches |
13 | Mon 23 July 2011 | Binary search; trees; heaps | L10 | | Bailey, chs. 12-13 |
14 | Tue 24 July 2011 | More on heaps. | L11 | | Bailey, ch. 14 |
15 | Wed 25 July 2011 | More on Java Generics; binary search trees (BSTs) | L12 | | |
16 | Thu 26 July 2011 | Hash tables | L13 | | Bailey, ch. 15 |
Week 5: graphs; sorting |
17 | Mon 30 July 2011 | Caches, graphs. | L14 | | Bailey, ch. 16 |
18 | Tue 31 July 2011 | More on graphs, sorting. | L15 | | |
19 | Wed 1 Aug 2011 | More on sorting. | L16 | | |
20 | Thu 2 Aug 2011 | Even more on sorting, final exam review | L17 | | |
21 | Sat 4 Aug 2011 | Final examination -- MAKE SURE YOU BRING YOUR STUDENT ID WITH YOU. | | | |