CSE 241 Home Page, Fall 2008

Welcome to the home page for CSE 241, Algorithms and Data Structures. CSE 241 meets Mondays and Wednesdays from 1:00 to 2:30 PM in Whitaker 218. On this web site, you will find course information, handouts, and assignments. The site will periodically be updated to communicate course developments to the class.

Your instructor is Dr. Jeremy Buhler. Please see the course overview for a list of TAs.

Announcements

12/4/2008
Homework 5 solutions are now posted.
12/2/2008
Due date status changes as of right now: Homework 5 is due at 5 PM on Thursday, 12/4. Lab 4 is due at 5 PM on Monday, 12/8. Please see the corrected posted version of the homework for an important missing piece of Problem 5.
11/24/2008
There is a pile of new handouts, covering B-trees, breadth-first search, and Dijkstra's algorithm.
11/17/2008
Homework 5 is now posted.
11/13/2008
Lab 4 is now posted. It is given in two parts, 4a and 4b. Please read the instructions at the top of either lab document to understand the relationship between the two.
11/6/2008
Homework 4 solutions are now posted.
11/5/2008
There is a pile of new handouts, covering counting and radix sort, binary search trees, and binary heaps. I've also updated the skip list handout from 11/3 with some of the analysis from our in-class exercise.
10/28/2008
Lab 3 is now posted, due 11/17.
10/22/2008
Homework 3 solutions are now posted.
10/20/2008
Please take a moment to fill out a midterm evaluation and get it to me, anonymously or otherwise.

There is a new handout summarizing our results on decision tree lower bounds.

9/22/2008
There is a new handout posted on the Master Method for recurrences.
9/18/2008
Homework 1 solutions are now posted.
9/17/2008
Parker's office hours (Tuesdays and Thursdays) are now in Urbauer 114, to avoid conflict with classes being held in CEC.
9/16/2008
There is a new handout on binary search that includes my suggested correctness proof and running-time analysis.
9/12/2008
There is a new handout reviewing key results on asymptotic notation.
9/3/2008
There are two new handouts, on statement counting and fast closest pair, respectively.
8/26/2008
Please check that you can send and receive email from your address as it appears in WebSTAC. I will use these addresses to set up our lab grading and turn-in system.

Course Handouts and Other Documentation

Note: course materials are provided either in HTML or in Adobe PDF format.

Reference Materials

Below are some links to programming reference materials that you may find useful. These materials were kindly provided by previous instructors for this course; I have done some minimal edits to remove egregiously outdated information, but nothing else.

CSE 241
Last update: 12/4/2008