12:39
Understanding B-Trees: The Data Structure Behind Modern Databases
09:15
How do computers add numbers so quickly?
15:37
AES: How to Design Secure Encryption
06:33
Understanding the Halting Problem
14:37
Minimax: How Computers Play Games
10:32
An Introduction to Propositional Logic
06:33
Can You Always Win a Game of Tetris?
06:42
How Fast Could a Computer Be?
08:31
How Dijkstra's Algorithm Works
06:05
When to Launch a Mars Mission
08:23
What Is the Pigeonhole Principle?
08:10
A Computer Built With Dominos
05:43
Randomness and Kolmogorov Complexity
08:45
What Is a Binary Heap?
06:54
Race Conditions and How to Prevent Them - A Look at Dekker's Algorithm
00:14
Getting Unstuck 2020 - 10 days of Scratch projects!
04:31
The Science Behind Elevators
09:23
Pattern Matching in Python?
06:03
What Are Bloom Filters?
05:16
How Google's PageRank Algorithm Works
07:28
Understanding Logic Gates
05:13
How to Send a Secret Message
07:27
Hamming Codes - How Data Corrects Itself
08:14
The Mathematical Danger of Democratic Voting
09:22
How to Count Dice Rolls - An Introduction to Dynamic Programming
11:12
How Do You Calculate a Minimum Spanning Tree?
X
About
Spanning Tree is an educational video series about computer science and mathematics.
See more at spanningtree.me
To be notified when a new video is released, sign up for the Spanning Tree mailing list at spanningtree.substack.com/
Spanning Tree is created by Brian Yu. brianyu.me/
Email me at brian@spanningtree.me to suggest a future topic.
Support the channel: ko-fi.com/spanningtree
Tags