CSE 331 Algorithms and Data Structures

Fall, 2008

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

Instructor: Yanni Sun yannisun@cse.msu.edu, Phone: 432-5169

Office Hours (EB3134): Tue & Thur 4:30-6:00 PM

TA : Anu Pakanati, email: pakanati@msu.edu

Office hours (EB 3203): Mon & Wed 12:30-2:30pm 

Welcome to 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.

Handin system: www.cse.msu.edu/handin

Announcements

9/4/2008

The instructor's office hours are updated. 

8/26/2008

1. There is no office hour on 9/1/2008 because of Labor Day. Please make appointments with Anu if you have questions.

2. The first homework will be out today and due next Thursday (11:59pm 9/4/2008).  

8/22/2008 

Welcome back! The first class starts at 3:00pm on August 26. Dr. Yanni Sun will be out of town on August 28. Dr. John Weng will be your instructor this Thursday. For the same reason, Dr. Yanni Sun cannot hold office hours on August 26 and August 28. 

Course Handouts and Other Documentation

Syllabus

dates topics & reading class notes homework
Aug. 26, 27 insertion sort; algorithm analysis. Chapter 1.2, Chapter 2, Chapter 7.2 lecture-1.pdf, insertionsort-analysis.pdf hw1 is due by 11:59pm on 9/4/2008
Sept. 2, 4 merge sort and recursion tree; quick sort. Chapter 7.6 and Chapter 7.7. mergesort-sep2.pdf quicksort-sep4.ppt