Algorithms
A course that explores the fundamentals of algorithms. How do we make them? How do they work?
We explore what is needed to multiply two numbers. We discover branching and iteration.
Lesson Plan
1. Exploring the Challenge
;
To make a loop, we need to learn how to jump
Lesson Plan
lock
2. Iterations (Loops)
(requires student license)
(requires student license)
;
We start automating loops.
Lesson Plan
lock
3. Automating Loops, Part 1
(requires student license)
(requires student license)
;
We fully automate loops with the help of a Data RAM module
Lesson Plan
lock
4. Automating Loops, Part 2
(requires student license)
(requires student license)
;
We find a way to stop a loop.
Lesson Plan
lock
5. Stopping a loop - Foundations
(requires student license)
(requires student license)
;
We find a way to stop a loop.
Lesson Plan
lock
6. Stopping a loop
(requires student license)
(requires student license)
;
We design a multiplication program
Lesson Plan
lock
7. A multiplication program
(requires student license)
(requires student license)
;
How a computer addresses memory by pointing at it.
Lesson Plan
lock
8. Data Pointers
(requires student license)
(requires student license)
;
Introduction of a Latch to enable data pointers at runtime of a program.
Lesson Plan
lock
9. Automating Data Pointers
(requires student license)
(requires student license)
;
Introduction of a Latch to enable loops at runtime of a program.
Lesson Plan
lock
10. Automating Loops
(requires student license)
(requires student license)
;
We build a general-purpose machine that can do multiplication
Lesson Plan
lock
11. Multiplication
(requires student license)
(requires student license)
;
We design a machine that computes Fibonacci numbers and prints them on a display.
Lesson Plan
lock
12. Fibonacci Numbers and the Print() statement
(requires student license)
(requires student license)