CS 361 "Data Structures and Algorithms" Spring 2004

Instructor:

• Jared Saia (email: saia at cs.unm.edu). Please put the text "cs361" in the subject line, this helps my mail reader parse your email. I read email once every afternoon at around 3pm, I'll respond to your email as soon as I read it, please be patient)
• Office: FEC 301H, phone: 277-5446 (note: my voice mail system is nonfunctional, please use email if you want to leave me a message)
• Office Hours: Tuesdays 3-4pm, Fridays 2-3pm, or by appointment (note that the times I'm most likely to be in the office are Tuesdays, Thursdays, and Friday mornings)

Teaching Assistant

• Nathan Swanson (email: nate at cs.unm.edu))
• Office Hours: Mondays 1:30-2:30, Weds 1:30-2:30 or by appointment. Office: 301A FEC
• Lab Section: Thursday 5:30-6:20 DSH134, Friday 1:00-1:50 TAPY 218 (note: you *must* register for one of these)

Meeting Times:

• Tuesdays and Thursdays 4:00-5:15pm in Woodward Hall 149.

Early Evaluation Form

• Early Course Evaluation Form

cs361 E-mail List:

• Directions for subscribing to the class email list are here. This link also contains an archive of the mailing list.

Assignments:

Homeworks

• Pretest, Due Tuesday January 27th at the beginning of class,
• Assignment 2 due February 3rd, 2004.
• Assignment 3 due February 10th, 2004.
• Assignment 4 due February 17th, 2004.
• Assignment 5 due March 2nd, 2004.
• Assignment 6 due March 11th, 2004.
• Assignment 7 due April 6th, 2004.
• Assignment 8 due April 22nd, 2004.
• Assignment 9 due May 4th, 2004.

Midterm

• Midterm Solutions

Final Exam

• Final Solutions
• Histogram for Grades on Final

Project

• Class Project Page

Slides from Lectures:

• Lecture 1
• Lecture 2
• Lecture 3
• Lecture 4
• Lecture 5
• Lecture 6
• Lecture 7
• Lecture 8
• Lecture 9
• Lecture 10
• Lecture 11
• Lecture 12
• Lecture 13
• Lecture 14
• Lecture 15
• Lecture 16
• Lecture 17
• Lecture 18
• Lecture 19
• Lecture 20
• Lecture 21
• Lecture 22
• Lecture 23
• Lecture 24
• Lecture 25
• Lecture 26
• Lecture 27

Syllabus

Previous Classes

• Spring 2003 taught by me
• Fall 2002 taught by Cris Moore
• Spring 2000 taught by Bernard Moret
• CSE326 Data Structures taught at the University of Washington, Summer 2002
• Basic Algorithms taught at NYU, Fall 2002

Annihilator Notes

• Lec 1
• Lec 2
• Lec 3

Animations and Data Structure Resources

• Balanced Tree Applet

• Red-Black Trees (these are a little different from the ones we discussed in class --- there is data everywhere, and leaves are allowed to be red.)

• Splay trees (each item inserted or searched for becomes the root, making the tree more balanced as it goes)

• More splay trees

• Yet more splay Trees

• Sorting Algorithms (with Java source code). Thanks to Sheri Winfield for finding this!

• Original paper on Skip Lists (by Bill Pugh). Here is a demo of skip lists --- thanks to Cathy Alarid for finding it!