Exam 1

Heaps, Binary Search Trees

Mathematical Background
- Growth of Functions
- Mathematical Induction

Elementary Data Structures
- Arrays
- Linked Lists
- Stacks
- Queues
- Simple Trees

Analysis of Algorithms
- The Big-O Notation
- Time and Space Complexity
- Simple Sorting Algorithms

Sorting and Searching
- Sorting Methods
- Binary Search
- Finding Majority

Exam 2

Single-Source Shortest Path
- Dijkstra
- Bellman-Ford

Graph Algorithms 2
- Connected Components
- Bridges
- Articulation Points

Graph Algorithms 1
- Graph Representation
- Breadth-First Search
- Depth-First Search
- Topological Sorting

Dynamic Programming 1
- Sequence alignment
- Fibonacci
- Tower of Hanoi
- Longest Common Subsequence
- Coin Change Problem

Greedy Algorithms, Disjoint-Set Unions
- Minimum-Cost Spanning Tree: Kruskal, Prim
- Huffman Coding

Dynamic Programming 2
- Longest Increasing Subsequence
- All-Pairs Shortest Path: Floyd-Warshall
- Egg Dropping Puzzle
- Knapsack

Backtracking, Branch-and-Bound
- N-Queens
- Travelling Salesman Problem
- 0/1 Knapsack

Final Exam