CSE 331 Algorithms and Data Structures

Spring, 2008; Section 1

Tue & Thur 10:20-11:40 AM (EB1234)

Instructor: George Stockman stockman@cse.msu.edu, Phone: (517) 355-5240

Office Hours (EB3115E): Mon & Thur 2:00-4:00 PM

Spring, 2008; Section 2

Tue & Thur 3:00-4:20 PM (EB1234)

Instructor: John Weng weng@cse.msu.edu, Phone: (517) 353-4388

Office Hours (EB2325C): Mon & Wed 5:00-6:00 PM

TA (both sections): Greg Singer singergr@cse.msu.edu

Office hours (EB3203): Tue & Thur 4:30-6:30 PM

This is the home page for CSE 331: Algorithms and Data Structures

In this course, students will survey fundamental data structures and many associated algorithms. Study of classical abstract data types (ADT) will be fairly comprehensive. Emphasis will be placed on matching the appropriate data structures and algorithms to application problems. Analysis of algorithms is crucial to making proper selections, so analysis is important in the course. This course assumes that students are already familiar with advanced programming techniques including the definition of classes, and use of dynamic memory and linked data structures, including lists and trees.

Even though the treatment of algorithms and data structures is mostly conceptual, students are expected to be able to transform these algorithms and data structures into programs with proper approaches of software module development.

Syllabus

Homework for Section 1
Homework for Section 2
(Guidelines)
Solutions can be found in the homework folders

Lectures for Section 1
Lectures for Section 2

Examples

Messages

Course resources