Graph Algorithms: Depth-First Search (DFS): Pseudo-Code and Running Time

Dynamic Programming: The Knapsack Problem

Dynamic Programming: The RNA Secondary Structure Problem

Dynamic Programming: The All-Pairs Shortest Paths Problem

Dynamic Programming: The Longest Common Subsequence Problem

Dynamic Programming: The Longest Increasing Subsequence Problem

Dynamic Programming: The Weighted Compatible Intervals Problem

Greedy Algorithms: The Single-Source Shortest Paths Problem: Dijkstra's Algorithm

Dynamic Programming: Computing Binomial Coefficients

Greedy Algorithms: Huffman Coding

Greedy Algorithms: Minimum Spanning Trees: Prim's Algorithm

Greedy Algorithms: Optimization Problems and Greedy Algorithms

Greedy Algorithms: The Compatible Intervals Problems

Graph Algorithms: Depth-First Search (DFS): Directed Acyclic Graphs and Topological Sort

Graph Algorithms: Depth-First Search (DFS): Strongly Connected Components

Graph Algorithms: Depth-First Search (DFS): Illustration

Graph Algorithms: Depth-First Search (DFS): Pseudo-Code and Running Time

Data Structures: Hash Tables: Open-Address Hashing

Data Structures: Hash Tables: Universal Hashing

Data Structures: Hash Tables: Heuristic Hash Functions

Data Structures: Hash Tables

Data Structures: Hash Tables: Collision Resolution by Chaining

Data Structures: Disjoint Sets: Linked-List Implementation

Data Structures: Disjoint Sets: Forest Implementation

Data Structures: B-Trees: Insertion and Deletion