instructor: Dave Kauchak
e-mail: [first_initial][last_name]@cs.pomona.edu
office hours: Edmunds 221
Mon. 1:30-3pm, Tue. 2:30-4pm, Wed. 10:30am-12
and by appointment
TAs: Ian Carr, Will Coster, Joel Detweiler
office hours: Edmunds 229
Sun. 8-10pm, Mon. 7-9pm, Tue. 8-10pm
time: T/Th 9:35-10:50am
location: Edmunds 114
lab: Wed 1:15-2:30pm OR 2:45-4:00pm
lab location: Edmunds 229
web page: http://www.cs.pomona.edu/classes/cs062/
textbooks:
general information:
The course title says it all... this course is an introduction to the basic computer science data structures. In addition, you'll get more hands-on experience with Java and C++ as well as general advanced programming concepts such as object-oriented design and complexity analysis. The catalog description can be found here.
We will briefly review some Java basics at the beginning of class, but this class has cs51 (or AP Computer Science) as a prerequisite. If you have any question if the class would be appropriate for you feel free to discuss this with myself or any of the other CS faculty.
Date | Topic | Reading | Problems | Comments |
---|---|---|---|---|
1/19 | admin, intro, OO principles | Ch. 1 | ||
1/20 | No lab | |||
1/21 | comments, javadoc, Vectors | Ch. 2, 3 | 1.1, 1.3 | |
1/26 | arraylist, generics | Ch. 4 | 2.3, 3.7 | |
1/27 | Lab 1 | |||
1/28 | graphics in java | 3.15 | Assignment 1 | |
2/2 | asymptotics | Ch. 5 | 3.5 | Assignment 1 due 11:59pm |
2/3 | Lab 2 | |||
2/4 | induction quicksort slides (pdf) | Ch. 6 | 5.5, 5.11, 5.21 | Assignment 2 |
2/9 | more sorting | Ch. 7 | 5.9, 5.23 | Assignment 2 due 11:59pm |
2/10 | Lab 3 | |||
2/11 | interfaces, iterators | Ch. 8 (except 8.1) | Assignment 3 | |
2/16 | operators | Ch. 9 | 8.3 | Assignment 2 due 11:59pm |
2/17 | Lab 4 (solution) | |||
2/18 | lists | Assignment 4 | ||
2/23 | stacks and queues | Ch. 10 | 9.5, 9.15 | Assignment 4 due 11:59pm |
2/24 | Lab 5 | |||
2/25 | list applications | Assignment 5 Due 6pm Friday 3/5 | ||
3/2 | binary trees | Ch. 12 | 10.3, 10.13 | |
3/3 | Lab 6 - review Sample questions | |||
3/4 | midterm | |||
3/9 | binary search trees | Ch. 14 (except 14.5, 14.6) | Assignment 6 Due noon Friday 3/12 | |
3/10 | Lab 7 | |||
3/11 | No Class | |||
3/16 | Spring break | |||
3/17 | Spring break | |||
3/18 | Spring break | |||
3/23 | heaps | Ch. 13 | Assignment 7 | |
3/24 | Lab 8 | Terminal, Emacs & SVN | ||
3/25 | more heaps and heapsort sorting lower bound | 13.2a | ||
3/30 | hashing | Ch. 15 | Assignment 7 due 11:59pm | |
3/31 | Lab 9 | |||
4/1 | more hashing | 15.9 | Assignment 8 | |
4/6 | C++ | 15.3 | Assignment 8 due 11:59pm | |
4/7 | Lab 10 | |||
4/8 | more C++: classes | Assignment 9 | ||
4/13 | more C++: pointers, parameters | Assignment 9 due 11:59pm | ||
4/14 | Lab 11 | |||
4/15 | more C++: big 3 | Weiss 3-18, 3-15 | Assignment 10 | |
4/20 | graphs | Ch. 16 | big3 | |
4/21 | Lab 12 | destructor | ||
4/22 | more graphs | Assignment 10 due 11:59pm | ||
4/27 | more graphs connectedness connected components cycles Dijkstra's shortest paths | 16.1 | Assignment 11 | |
4/28 | Lab 13 | |||
4/29 | more graphs Dijkstra slides (pdf) | |||
5/4 | review Sample Final Questions |