CS 362 (formerly known as: CS 461), "Data Structures and Algorithms II" Spring 2006

Instructor

• Jared Saia
• Email: "last name" at cs.unm.edu. I read email once every afternoon at around 3 or 4. I'll respond to your email as soon as I read it.
• Office: FEC 301H, phone: 277-5446 (note: please use email if you want to leave me a message, my voice mail system is nonfunctional.)
• Office Hours: Tuesdays 1-2pm, Weds 3-4pm, Thursdays 1-2pm or by appointment Note: the best times for appointments with me are Tuesday, Thursday, and Friday.

Teaching Assistant

• Navin Rustagi. Email: "navin" at cs.unm.edu
• Office Hours: Mondays 10:45-12:15 and Fridays 10:45-12:00 and appointment. Location 301A

Class Info

Class E-mail List

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

Early Course Evaluation

• Evaluation Form

Homeworks

• hw 1
• hw 2
• hw 3
• hw 4
• hw 5
• hw 6

Grades

Tests

• The Midterm will be March 23rd in class
• midterm
• midterm solutions
• final exam and solutions

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

Syllabus

Previous Classes

• Fall 2003 class taught by Jared Saia
• Spring 2000 taught by Bernard Moret
• CS421 Intro to Algorithms taught at the University of Washington, Winter 2002.
• Past Quarters of CS421 at the University of Washington
• MIT Open Courseware for EE and CS The "Introduction to Algorithms" class has lots of good problems and solutions!

CS 361

• Spring 2003 taught by Jared Saia
• Fall 2002 taught by Cris Moore
• CSE326 Data Structures taught at the University of Washington, Summer 2002

Annihilator Notes

• Lectures 9 through 12 from my last CS361 class which are located here
• Notes from three lectures on Annihilators at the University of Illinois Urbana Champagne. Most of my discussion is based on these lectures.
  • Lec 1
  • Lec 2
  • Lec 3

General Theory Links

• Approximability results for NP-Optimization Problems
• The original and the updated Theoretical Computer Science Cheat Sheet
• The Stony Brook Algorithm Repository
• LEDA: a library of efficient data types and algorithms
• Theoretical CS on the Web
• SIGACT News
• Aravind Srinivasan's Math and Theory Links

Animations and Data Structure Resources

• Gallery of Network Images some cool real world graphs: high school dating networks, the internet, power grids, etc.

• 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!