CompSci 161 - Design and Analysis of Algorithms - Fall, 2023 (Dillencourt)

Preliminary list of topics

This is a preliminary, high level, prospective list of topics, posted at the start of the quarter. Its sole purpose is to give you an idea of what topics we intend to cover.

For an more detailed list of topics that have been covered and which slides were covered in each lecture, click here.

• Introduction; mathematical review; asymptotic notation.
• Data structure review. Binary search trees, binary search
• Sorting: Comparison-based sorting. Address calculation sorting. External sorting
• Greedy algorithms
• Divide-and-conquer algorithms
• Dynamic programming
• Graphs/graph algorithms
• Weighted graphs: shortest paths, minimum spanning trees
• Selection