*Overview

 

*Announcements

   

Notes and homework

 

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/23/2008

Graded homework 2 was returned today.

9/18/2008

HW3 is out and is due by the class on 9/30.

9/11/2008

Graded homework 1 was returned today. 

9/9/2008

HW2 is out and is due by next Tuesday's class (9/16). Bring your papers to class. Submit your source codes via handin. You are responsible to compile and run your programs on arctic.cse.msu.edu. We will compile your programs using g++. For each homework, attach the homework cover sheet. If you have multiple pages, write your netID or your name on each page. We appreciate it if you can answer each problem in order. Happy coding!

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  homework-coversheet

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

 

Sept. 9, 11

trees: BST, AVL trees. Chapter 4

trees-sep9.ppt AVL-tree-sep11.ppt

hw2 is due by 3pm on 9/16/2008.

Sept. 16, 18

AVL trees; B trees. Chapter 4

B-tree.ppt

hw3 is due by 3pm on 9/30/2008

 Sept. 23, 25

 Heaps. Chapter 6

heaps.ppt 

 

 Sept. 30, Oct. 2

 Heaps. Chapter 6

 study-guide-9-30.doc

 Exam 1 on Oct. 2

 Oct. 7, 9

Hashing. Chapter 5

 hashing.ppt

 hw4 is due by 3pm on 10/16/2008