Lectures Notes

This page currently contains lecture notes from CPSC 320 taught at UBC in 2007 by Mr. Backer. Slides are available in 1, 2, or 4 slides per page.

• Review of asymptotic notation [1] [2] [4]
• Sorting and lowerbounds [1] [2] [4]
• Solving recurrences
• Solving directly [1] [2] [4]
• Master Method [1] [2] [4]
• Divide-and-conquer: Order statistics [1] [2] [4]
• Greedy algorithms
• Activity selection [1] [2] [4]
• Minimum spanning trees [1] [2] [4]
• Shortest paths [1] [2] [4]
• Dynamic programming
• Coin changing [1] [2] [4]
• Weighted activity selection
• All pairs shortest path
• Longest common subsequence and global sequence alignment [1] [2] [4]
• Geometry
• Range queries.
• Closest points.
• Data structures
• Binary trees.
• B-trees.
• NP-hardness [1] [2] [4]
• Review [1] [2] [4]