Courses from 1000+ universities
Buried in Coursera’s 300-page prospectus: two failed merger attempts, competing bidders, a rogue shareholder, and a combined market cap that shrank from $3.8 billion to $1.7 billion.
600 Free Google Certifications
Management & Leadership
Data Analysis
Digital Marketing
Introduction to Graphic Illustration
Unlocking Information Security I: From Cryptography to Buffer Overflows
Quantum Mechanics for Everyone
Organize and share your learning with Class Central Lists.
View our Lists Showcase
Explore collision detection in computer graphics, from basic animation to advanced optimization techniques like sweep and prune, uniform grids, K-D trees, and bounding volume hierarchies for efficient simulations.
Explore the Discrete Fourier Transform's derivation, properties, and significance in modern technology through a discovery-oriented approach, from basic concepts to complex exponentials.
Explore heuristic approaches and optimization techniques for the Traveling Salesman Problem, including nearest neighbor, greedy, Christofides, local search, simulated annealing, and ant colony optimization.
Explore the mathematical foundations and complexities of PageRank, the revolutionary search algorithm. Learn about Markov chains, stationary distributions, and their practical applications in web search technology.
Explore PNG image compression, its lossless quality, and the trade-off between speed and efficiency. Learn about newer formats like QOI that offer faster alternatives with comparable results.
Explore the mathematical foundations and signal processing insights behind JPEG compression, including color spaces, discrete cosine transform, and quantization techniques for efficient image encoding.
Explore the fascinating world of computer graphics, focusing on the Marching Squares algorithm for rendering complex shapes like metaballs. Learn about implicit functions, optimization techniques, and 3D extensions.
Explore the evolution of data compression algorithms, from information theory principles to Huffman's groundbreaking discovery, with practical examples and implementation insights.
Explore the ingenious Gilbert Johnson Keerthi algorithm for detecting object collisions, covering convexity, Minkowski sums, support functions, and implementation details in 2D space.
Explore the Fast Fourier Transform algorithm through polynomial multiplication, discovering its efficiency in converting between coefficient and value representations for complex calculations.
Learn a systematic approach to tackle dynamic programming problems, illustrated with examples like longest increasing subsequence and optimal box stacking.
Comprehensive exploration of Depth First Search algorithm, covering implementation methods, traversal types, and practical applications in graph theory.
Explore the Towers of Hanoi puzzle through a strategic approach, converting it into a recursive solution. Learn a framework for tackling complex recursive problems and analyze the unraveling of recursion.
Explore A* search algorithm for optimal route finding, comparing greedy and uniform cost approaches. Learn how modern mapping apps balance efficiency and accuracy.
Get personalized course recommendations, track subjects and courses with reminders, and more.