CS-130b: Data Structures and Algorithms

Instructor: Dr. Subhash Suri (suri@cs.ucsb.edu)

Class: Tu-Th 3:30-4:45 (PHELP 3523)

Discussion: Tu 11-12 HFH 1152

Office Hours: Wed 11-12 (Engr I, 2111)

Lecture Slides
- Introduction (lecture 1) (txt)
- Activity Scheduling (txt)
- Huffman Coding (txt)
- Dijkstra, Prim, and Kruskal (pdf)
- Divide and Conquer (pdf)
- Dynamic Programming (pdf)
- NP-Completeness (Lecture 1) (Lecture 2) (Lecture 3)
- Approximation Algorithms (Vertex and Set Covers)
- Approximation Algorithms (Bin Packing)
- Approximation Algorithms (Others)
- Lower Bounds (pdf) or (Landscape pdf) or (postscript)
Homework Assignments

1. Homework #1. Due IN CLASS on Jan 15, 2009.
2. Homework #2. New Deadline: Feb 24, 2009.
2. Homework #3. Due IN CLASS on Mar 5, 2009.
Programming Assignments

1. Programming Assignment #1 Lab 1. DEADLINE Feb 16, Monday (5:00 PM).
Quizzes

Quiz 1 Jan 20, 2009.
Quiz 2 Feb 10, 2009.
Practice Problems

Greedy Algorithms Problems .
Greedy Algorithms Solutions .
Exams

1. Midterm #1, Jan 29, in class.
2. Midterm #2, Mar 12, in class.