Reducible Courses

Building Collision Simulations - An Introduction to Computer Graphics

3 ratings

Build particle collision simulations from discrete and continuous detection to broad-phase acceleration with sweep-and-prune, uniform grids, k-d trees, and bounding volume hierarchies.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

The Discrete Fourier Transform - Most Important Algorithm Ever?

Derive the Discrete Fourier Transform from first principles by testing cosine and sine wave representations and resolving the phase problem with complex exponentials.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

The Traveling Salesman Problem - When Good Enough Beats Perfect

See why exact Traveling Salesman solutions become impractical and how heuristics, approximation, local search, and randomized methods find good tours.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

PageRank - A Trillion Dollar Algorithm

See how stationary distributions of Markov chains and a damping factor turn web surfing into PageRank, the algorithm behind Google search.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

How PNG Works - Compromising Speed for Quality

Explore how PNG uses lossless compression and adaptive filtering, and why the simpler QOI format can achieve comparable compression at much higher speed.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

The Unreasonable Effectiveness of JPEG: A Signal Processing Approach

Understand JPEG’s mathematical core through color spaces, the discrete cosine transform, quantization, and entropy coding.

• YouTube
• 35 minutes
• Self-Paced
• Free Video

How Computers Draw Weird Shapes - Marching Squares Algorithm

See how marching squares turns implicit functions into rendered metaballs through spatial sampling, case analysis, optimization, and a bridge to marching cubes.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Huffman Codes - An Information Theory Perspective

See how information theory motivates Shannon–Fano coding and Huffman’s optimal, bottom-up compression algorithm through examples and implementation.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

A Strange But Elegant Approach to a Surprisingly Hard Problem - GJK Algorithm

Understand the GJK algorithm through convexity, Minkowski differences, support functions, and a 2D implementation for detecting shape intersections.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

The Fast Fourier Transform - Most Ingenious Algorithm Ever?

Discover the Fast Fourier Transform through polynomial multiplication, roots of unity, recursive evaluation, and interpolation with the inverse FFT.

• YouTube
• 28 minutes
• Self-Paced
• Free Video

Simple Steps for Solving Dynamic Programming Problems

Learn a five-step framework for solving dynamic programming problems through longest increasing subsequence and box-stacking examples.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Depth First Search Explained - Algorithm, Examples, and Code

An intuitive walkthrough of depth-first search, from graph traversal and recursive or iterative code to preorder/postorder traversals and graph applications.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Towers of Hanoi - A Complete Recursive Visualization

A visual walkthrough of solving the Towers of Hanoi by developing a recursive strategy, implementing it, and tracing how the recursion unfolds.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

A* Search: How Map Applications Find Shortest Routes

Explore A* search algorithm for optimal route finding, comparing greedy and uniform cost approaches. Learn how modern mapping apps balance efficiency and accuracy.

• YouTube
• 16 minutes
• Self-Paced
• Free Video