CS127 (Data Structures)
Winter 2007, Carleton College

[Jump to current week]

Basic information:

Course Resources:

Course Materials:

Week 0:
The Carleton Sentinel is the mailing list of the CS community here at Carleton. We'll use it to send occasional updates on things that might be of interest (talks, summer jobs, social events, etc.). Sign up here!
There is a form for office-hours scheduling available. Please fill it out by Friday, 22 December 2006, and I'll schedule office hours soon thereafter. (Be sure to include your email address!)
Week 1: intro to 127 and data structures; dictionaries (Chapter 1).
We've moved! We'll be in CMC 328 (instead of CMC 210) for all class meetings.
PS1 (convert the sorted-array dictionary's lookup to binary search) is due on Sunday, 7 January 2007, at 11:59p via hsp.
Week 2: inheritance, excepctions, and efficiency (Chapters 3 and 2).
Laura's prefecting sessions will be held on Sundays 3--4pm and Wednesdays 10--11pm in CMC 210.
PS2 (array doubling and abstract-class organization) is due on Thursday, 11 January 2007, and Sunday, 14 January 2007.
If you're looking for any files from the course (including in-class code or code/questions for problem sets), they're in /Accounts/courses/cs127/dlibenno on the mathcs machines.
Week 3: linked lists (Chapter 4)
Peer evaluations for PS2 are due by email at 11:59p on Tuesday, 16 January 2007.
PS3 (JPods) is due on Sunday, Monday, and Tuesday, 21, 22, and 23 January 2007.
Week 4: stacks, queues, and a hint of recursion (Chapters 5, 6, and 7)
The first midterm is now officially (re)scheduled for next Monday, 29 January 2007.
Sunday prefecting has been moved to 4--5pm. (The Wednesday 10--11pm session remains intact.) Both are in CMC 210.
Peer evaluations for PS3 are due by email at 11:59p on Thursday, 25 January 2007.
Week 5: recursion (Chapter 7)
PS4 (stacks and the minibrowser) is due on Wednesday, 31 January 2007 Thursday, 1 February 2007 at 11:59p.
Week 6: trees, binary search trees (Chapter 8)
Week 7: augmenting data structures, balanced binary search trees (Chapter 11).
PS5 (search with context) is due on Monday, Wednesday, and Thursday, 12, 14, and 15 February 2007. (See next week.)
Week 8: priority queues, hashing (Chapters 8 and 9).
Problem Set 5 is due on Tuesday, 20 February 2007, at 11:59p. Sorry again for the mixup with the due dates.
Problem Set 6 (Boggle) is due on Thursday, 22 February 2007 (Parts I and II) and Monday, 26 February 2007 (Part III).
Week 9: sorting (Chapter 10)
Problem Set 7 (semantic networks) is due on Sunday, Tuesday, and Thursday, the 4th, 6th, and 8th of March.
The second midterm is now officially scheduled for Friday, 2 March 2007.
Week 10: sorting, graphs (Chapter 12)
Finals Period:
Our scheduled finals slot is Tuesday, 13 March 2007, from 8:30 to 11:00a.