CS 561 Algorithms and Data Structures Fall 2010

Instructor

• Jared Saia
• Email: "last name" at cs.unm.edu.
• Office: FEC 157, phone: 277-5446 The best way to reach me is generally via email.
• Office Hours: Tuesdays and Thursdays 2:30-3:30 or by appointment.
• Note: If I'm in my office and the door is open, feel free to come in. If the door is closed, I'm probably hard at work on a paper or grant or research problem. Please come by another time or make an appointment via email.

Teaching Assistant

• Dandan Mo; Email: mdd at cs.unm.edu. Office: FEC 301A
• Office Hours: Monday 10:00-11:30 and Weds 1:30-3:00PM

Class Info

Course Description

Text Book

Class E-mail List

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

Homeworks

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

Tests

• MIDTERM!
• Final Exam and Latex File for Final

Slides from Lectures:

• Pre Lecture 1
• Pre Lecture 2
• Topic 1 - Probability & Randomized Algorithms (Quicksort)
• Topic 2 - Randomized Data Structures (Hash Tables, Skip Lists, Count-min Sketch)
• Topic 3 - Divide and Conquer (Induction, Recurrences, Master Method, Recursion Trees, Annihilators)
• Topic 4 - Heaps and Loop Invariants
• Topic 5 - Binary Search Trees
• Topic 6 - Dynamic Programming
• Topic 7 - Greedy Algorithms
• Topic 8 - Amortized Analysis
• Topic 9 - Minimum Spanning Trees
• Topic 10 - BFS, DFS and Single Source Shortest Paths
• Topic 11 - All Pairs Shortest Paths and Floyd Warshall Algorithm
• Topic 12 - Network Flow The link points to Jeff Erickson's excellent lecture notes. We will use material from Lectures 15, 16 and 17 on this page.
• Topic 13 - Linear Programming The link points to Jeff Erickson's excellent lecture notes. We only look at lecture I and will only go through I.3
• Topic 14 - P, NP, NP-Hardness and Approximation Algorithms

Syllabus

Previous Classes

• Fall 2006 CS362 class taught by Jared Saia
• 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 notes.
  • 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

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!