Free · 25 activities · nothing to install

Free computer science fundamentals activities for your class

The big ideas of computer science are easier to see than to read about: a sorting race where merge sort finishes while bubble sort is still going, a search that spreads out from the start in waves, a logic gate that lights up when both inputs are on. Everything here is interactive, runs in a browser tab and opens with no account. It is grouped the way an introductory course runs, from how a computer stores information to how an AI learns, and each activity has a line on what it is good for in class.

The Pathfinding exploration running breadth-first search on a grid with walls. Explored cells spread out from the start, A, in shades of blue, toward the goal, B, and the counters read 330 cells visited.
Breadth-first search spreading out from A in waves, one step at a time, toward B.
Three sorting algorithms racing on the same data as bar charts: Bubble Sort and Selection Sort are still mixed up, while Merge Sort, on the right, is already done, its bars in order from shortest to tallest.
A sorting race on the same data: merge sort is done while bubble sort and selection sort are still going. That is O(n log n) against O(n^2).
An AND gate in the Circuit Logic walkthrough with both input switches set to 1 and the output lit at 1. Buttons below switch between AND, OR, NOT, NAND and XOR.
An AND gate: both inputs on, output 1. Switch to OR, NOT, NAND or XOR and compare.

Click any picture to see it full size.

How computers store information

Everything is numbers: text, pictures, codes, and the switches underneath.

Guided walkthrough · 3-5 min The Language of Binary

The first lesson: counting in 1s and 0s until it feels natural.

How computers think in 1s and 0s - and how you can too.

Guided walkthrough · 7 min What's Inside an Image File?

A photo as millions of numbers. Makes binary concrete right after the first lesson.

Every photo is just millions of numbers arranged in a clever way.

Guided walkthrough · 3-5 min How Compression Works

The same information in less space, and the idea of lossless compression.

Make files smaller without losing information - the magic of compression algorithms.

Guided walkthrough · 5-7 min Decode the Square: Inside QR Codes

Take apart a QR code: finder patterns and error correction students can see.

Take apart a QR code to discover finder patterns and error correction.

Guided walkthrough · 5-8 min Circuit Logic: AND, OR, NOT and the Basics of Computing

Toggle AND, OR and NOT, compare truth tables, then build a half adder.

Toggle interactive logic gates, compare truth tables, and build a half-adder circuit. See how three simple operations create all of computing.

Guided walkthrough · 5-7 min What is a Transistor: The Switch That Built the Modern World

The switch under every gate, and why Moore's Law mattered for fifty years.

Transistors are voltage-controlled switches with no moving parts. Learn how one builds a NOT gate, why Moore's Law doubled transistor counts for 50 years, and just how small modern chips really are.

Guided walkthrough · 3-5 min How Memory Works

RAM, cache and storage, and why where data lives changes how fast it is.

RAM, cache, and storage - understand where your computer keeps things.

Algorithms

Step-by-step procedures, and why some are much faster than others.

Guided walkthrough · 5-8 min What Is an Algorithm? Recipes for Computers

Everyday algorithms, putting steps in order, and a race between linear and binary search.

Explore everyday algorithms, order steps correctly, and race linear vs binary search to find a number.

Guided walkthrough · 5-8 min Flowcharts & Diagrams: Thinking in Systems

Flowchart symbols and a decision tree, and how a flowchart maps to code.

Learn flowchart symbols, walk through an interactive decision tree, and see how flowcharts map to code.

Guided walkthrough · 3-5 min Algorithms Visualized

A quick look at sorting and searching before the deeper lessons.

Watch sorting and searching algorithms in action - see why some are faster.

Guided walkthrough · 5-8 min Sorting Algorithms: Racing to Order

Race bubble, selection and merge sort, step through one comparison at a time, and see why O(n log n) wins.

Race Bubble Sort vs Selection Sort vs Merge Sort side by side, step through Bubble Sort one comparison at a time, and see why O(n log n) beats O(n^2).

Interactive Pathfinding

Students find a path by hand first, then watch BFS and A* do it and compare how many cells each explores.

Draw walls, pour water, and watch BFS and A* race to find the shortest path. Then try it yourself.

Guided walkthrough · 8-12 min Maze Generation

Six ways to build a maze, each one an algorithm students can watch.

Explore 6 different maze generation algorithms.

Guided walkthrough · 5-8 min Cellular Automata: Can Simple Rules Create Life?

Four rules, and the Game of Life: how simple rules produce complex behavior.

Explore Conway's Game of Life and discover how four simple rules create gliders, oscillators, and infinite complexity from a grid of cells.

Guided walkthrough · 5-7 min How Search Engines Work: Crawl, Index, Rank

Crawling, indexing and ranking: algorithms at the largest scale.

Explore the three big ideas behind every search engine: web crawlers that walk billions of pages, inverted indexes that turn queries into instant lookups, and PageRank that uses links as votes to rank the best results first.

First steps in programming

Variables, conditions and loops, before students choose a language.

Data and AI

How machines learn from data, and how data can mislead people.

Guided walkthrough · 3-5 min How AI Learns

Train a small neural network and watch it learn a pattern.

Train a neural network and watch artificial intelligence learn patterns.

Guided walkthrough · 5-8 min Inside a Neural Network: How Machines Learn Patterns

Neurons, weights and layers: adjust one neuron by hand, then watch a network train.

Explore how neurons, weights, and layers work together. Adjust weights on a single neuron, visualize a full network, and train one by watching loss decrease.

Guided walkthrough · 5-8 min Data Visualization: Turning Numbers Into Stories

Which chart for which data, and how to spot a misleading one.

Learn when to use bar charts, line charts, pie charts, and scatter plots. Spot misleading charts and test your skills with quizzes.

Guided walkthrough · 5-8 min Patterns in Data: Correlation, Trends & Outliers

Scatter plots, spurious correlations, and how one outlier moves a trend.

Build scatter plots interactively, explore spurious correlations, and toggle outliers to see how one point changes the whole trend.

Guided walkthrough · 5-7 min Sampling & Bias: Why Polls Get It Wrong

Why polls get it wrong: sample size and selection bias.

Polls and surveys try to learn about a big group by asking a small one. Explore how sample size affects accuracy, how selection bias secretly distorts results, and the famous 1936 election poll that got it spectacularly wrong.

Guided walkthrough · 6 min Randomness is Harder Than You Think

Students try to be random and fail. A short, memorable opener on patterns.

Challenge yourself to be truly random and spot fake patterns.

Using it with a class

Each walkthrough takes five to ten minutes and opens with no account, so it works as the start of a lesson, a station in a rotation, or homework to discuss the next day. When students are ready to write real programs, the Linux terminal runs Python, JavaScript, C and more, with a free account.

In short

These are free, interactive computer science fundamentals activities for middle school through introductory college: binary and how images, QR codes and compression store data, logic gates and transistors, algorithms with sorting races, binary search and BFS and A* pathfinding, a first line of code with variables, conditions and loops, and how neural networks learn and how data can mislead. They run in the browser with no install and no account.

Common questions

Do students need an account?

No. Every activity on this page opens in the browser with no sign-up. A free account adds the Linux terminal for writing real programs, and a free class of up to 50 students needs no student email addresses.

What grade levels is this for?

Most of it works from middle school up. The binary, logic gate, algorithm and first-code walkthroughs suit grades 6 to 9; sorting complexity, pathfinding and neural networks carry into high school and introductory college courses.

What courses does this fit?

Introductory computer science, computer science principles courses, middle school computing and technology classes, and the fundamentals unit of an IT or computer information systems course.

Will it run on school Chromebooks?

Yes. Everything runs in a browser tab with nothing to install.

Still have a question? Ask us, and a person will write back.

Start with a free class

Everything above opens with no account. A free class adds your students, each with a username and password and no email needed, so their progress and the terminal work are kept.

Page last reviewed September 2026.