Department of Computer Science
Pomona College
CS 62 - Data Structures and Advanced Programming
Spring 2010

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.

administrivia


Schedule

Note: This is a tentative schedule and is subject to change
DateTopicReadingProblemsComments
1/19admin, intro, OO principlesCh. 1  
1/20No lab   
1/21comments, javadoc, VectorsCh. 2, 31.1, 1.3 
1/26arraylist, genericsCh. 42.3, 3.7 
1/27Lab 1   
1/28graphics in java 3.15Assignment 1
2/2asymptoticsCh. 53.5Assignment 1 due
11:59pm
2/3Lab 2   
2/4induction
quicksort slides (pdf)
Ch. 65.5, 5.11, 5.21Assignment 2
2/9more sortingCh. 75.9, 5.23Assignment 2 due
11:59pm
2/10Lab 3   
2/11interfaces, iteratorsCh. 8 (except 8.1) Assignment 3
2/16operatorsCh. 98.3Assignment 2 due
11:59pm
2/17Lab 4 (solution)   
2/18lists  Assignment 4
2/23stacks and queuesCh. 109.5, 9.15Assignment 4 due
11:59pm
2/24Lab 5   
2/25list applications  Assignment 5
Due 6pm Friday 3/5
3/2binary treesCh. 1210.3, 10.13 
3/3Lab 6 - review
Sample questions
   
3/4midterm   
3/9binary search treesCh. 14 (except 14.5, 14.6) Assignment 6
Due noon Friday 3/12
3/10Lab 7   
3/11No Class   
3/16Spring break   
3/17Spring break   
3/18Spring break   
3/23heapsCh. 13 Assignment 7
3/24Lab 8Terminal, Emacs & SVN  
3/25more heaps and heapsort
sorting lower bound
 13.2a 
3/30hashingCh. 15 Assignment 7 due
11:59pm
3/31Lab 9   
4/1more hashing 15.9Assignment 8
4/6C++ 15.3 Assignment 8 due
11:59pm
4/7Lab 10   
4/8more C++: classes  Assignment 9
4/13more C++: pointers,
parameters
  Assignment 9 due
11:59pm
4/14Lab 11   
4/15more C++: big 3 Weiss 3-18, 3-15Assignment 10
4/20graphsCh. 16big3 
4/21Lab 12 destructor 
4/22more graphs  Assignment 10 due
11:59pm
4/27more graphs
connectedness
connected components
cycles
Dijkstra's shortest paths
 16.1Assignment 11
4/28Lab 13   
4/29more graphs
Dijkstra slides (pdf)
   
5/4review
Sample Final Questions
   
Final on Wednesday, May 12 at 9:00am.

Resources