Graphs

• Breadth First Search
• Depth First Search
• Topological Sort (DFS)
• Topological Sort (Kahn)
• Cycles
• Eulerian Paths and Tours
• Kosaraju's Strongly Connected Components
• Ford-Fulkerson's Maximum Flow

Shortest Paths

• Dijkstra'a Shortest Paths (Greedy)
• Bellman-Ford's Shortest Paths (Dynamic Programming)
• Floyd Warshall's Shortest Paths (Dynamic Programming)

Minimum Spanning Trees

• Prim's Minimum Spanning Tree (Greedy)
• Kruskal's Minimum Spanning Tree (Greedy)

Trees

• Binary Search Trees
• Rotations
• Red Black Trees
• B-Trees

Computational Geometry

• The Art Gallery Problem
• Closest Pair of Points (Divide and Conquer)

Segment Intersection

• Orientation of Three Points
• Line Segment Intersection (Existence)(CLRS)
• Any Pair of Segments Intersection (Sweep Line)

Triangulation

• Triangulation (Theory)
• Triangulation (Finding a Diagnoal)

Convex Hull

• Jarvis's March (Gift Wrapping)
• Graham's Scan

Strings

• Tries

Heaps

• Binary Heaps

RMQ

• The Range Minimum Query (RMQ) Problem
• Cartesian Trees

Divide and Conquer

• Mergesort Running Time Analysis
• Binary Search Correctness Proof

Dynamic Programming

• The Longest Increasing Subsequence
• Knapsack
• Coin Change

Greedy

• Maximum Activity Selection

Randomized Algorithms

• Quicksort
• Quickselect (k-select)
• Minimum Cut (Karger and Karger-Stein)
• Average-Case, Expected-Case and Worst-Case Running Time

Complexity Analysis

• The Master Theorem

Probability

• Counting Distinguishable and Indistinguishable Objects
• Random Variables
• Discrete Random Variables
• Conditional Probability

Graphics

• Working with Light
• The Virtual World (Pinhole Camera)
• The Virtual World (Model Transformations)
• The Virtual World (Viewing)
• Barycentric Coordinates
• Triangles
• Ray Tracing
• Recursive Ray Tracing
• Bresenham Line-Drawing Algorithm

Competitive Programming

• Input Handling Examples
• Algorithms / Data Structures Examples
• Permutations
• Combinations

Design Patterns in iOS

• Delegation
• Singleton