University of California, Santa Barbara
Computer Science Department
Data Structures and Algorithms II
CMPSC 130B (Spring 2007)
This material can only be used for UCSB CMPSC 130b Spring 2007 and
you
may print the slides for that purpose (and keep them forever).
This material is protected under the Copyright law and cannot
be copied and/or distributed manually or through electronic means
without written permission from Professor Teofilo F Gonzalez.
In what follows I use W, HS, Sa, AHU, etc. These refer to the books
listed in the class WEB page (first handout
www.cs.ucsb.edu/~teo/cs130b.html)
Course Syllabus
Introduction (PDF File)
Greedy Methods (PDF File)
This material comes from [Sa] pp 662 - 669. Exercise 9 in page
695 is essentially the printer problem. In [W] the printing
problem is in (the first part of) Section 10.1.1.
Conainer Ships
Single Source Shortest Paths (PDF File)
General Animation of the Single Source Shortest Paths algorithm
Animation of the Single Source Shortest Paths algorithm
Detailed Animation of the Single Source Shortest Paths algorithm
Algorithm (TXT File)
Additional Single Source Shortest Paths (PDF File)
Spanning Trees(PDF File)
Spanning Trees(PDF File)
Kruskal and Prim
Bin Packing (PDF File)
First Fit Animation
Huffman Coding (PDF File)
Huffman Coding (PDF File)
Huffman coding animation
Divide and Conquer
Divide-and-Conquer (PDF File)
Divide-and-Conquer (PDF File)
Correctness Proof for Strassen's Algorithm
Closes pair data structure example
Dynamic Programming
Dynamic Programming (PDF File)
Family Vacation DP (PDF File)
Matrix Product Chains DP (PDF File)
All pairs shortest paths and triangulating a
convex polygon (PDF File)
NP-Completeness (I)
NP-Completeness (II)
NP-Completeness (III)
Backtracking
Backtracking and branch and bound
Bipartite Matching
Knapsack Problem (Approximation Algorithm [S] Section 10.4)
Local Search
Divide and Conquer
Project first part (PDF File)
Total number of visitors to this page, since 1/1/2001,
is
