Computer Science
Grade 1
20 min
Moving Rusty Forward
Write simple instructions to move Rusty forward a certain number of steps.
Tutorial Preview
1
Introduction & Learning Objectives
Learning Objectives
Define an algorithm as a set of steps.
Explain that the order of steps is very important.
Create a simple sequence of instructions.
Follow an algorithm to predict an outcome.
Identify a mistake in a simple algorithm.
Use commands like 'Move Forward' and 'Turn'.
Have you ever wanted to teach a robot friend a new game? 🤖 Let's help our robot, Rusty!
Today, we will learn how to give Rusty instructions. These special instructions are called an algorithm. Getting the steps in the right order is super important!
Real-World Applications
Following a recipe to bake cookies 🍪
Getting dressed for school in the morning 👕
Building a tower with blocks 🧱
Brushing your teeth the right way ✨
2
Key Concepts & Vocabulary
TermDefinitionExample
Robot 🤖A machine that can follow our instructions.Our friend Rusty is a robot who needs our help.
Instruction ➡️One single step or command we give.Telling Rusty to 'Move Forward' is one instruction.
Algorithm 📜A list of instructions to finish a task.The list of all the steps to get Rusty to his toy is an algorithm.
Sequence 🔢Putting instructions in the correct order.You must move forward BEFORE you can pick up the ball.
Program 💻An algorithm written for a computer or robot.When we write down the steps for Rusty, we are making a program.
Bug 🐞A mistake in our instructions.Telling Rusty to turn the wrong way is a bug.
3
Core Syntax & Patterns
Move Forward Command
➡️ Move Forward
Use this to tell Rusty to move one square forward.
Turn Right Command
↪️ Turn Right
Use this to tell Rusty to turn to his right side.
Turn Left Command
↩️ Turn Left
Use this to tell Rusty to turn to his left side.
Pick Up Command
🖐️ Pick Up
Use this to tell Rusty to pick up an object in his square.
4 more steps in this tutorial
Sign up free to access the complete tutorial with worked examples and practice.
Sign Up Free to ContinueSample Practice Questions
Challenging
The algorithm for putting on shoes is: 1. Put on left sock. 2. Put on right sock. 3. Put on left shoe. 4. Put on right shoe. Which two steps could you swap and still have it work?
A.Step 2 and Step 3 (right sock and left shoe)
B.Step 3 and Step 4 (left shoe and right shoe)
C.Step 1 and Step 4 (left sock and right shoe)
D.Step 1 and Step 2 (left sock and right sock)
Challenging
Rusty is in the bottom-left corner of a tic-tac-toe board (a 3x3 grid). What is the SHORTEST algorithm to get him to the top-right corner?
A.Forward, Forward, Forward, Right, Right
B.Forward, Forward, Right, Right
C.Forward, Right, Forward, Right, Forward
D.Right, Right, Forward, Forward
Challenging
Rusty's code is: 'Repeat 2 times: (Go Forward, Pick up block). Then, Turn Right.' Rusty starts facing a row of 5 blocks. What happens?
A.He picks up all 5 blocks
B.He picks up 1 block and turns right
C.He picks up 2 blocks and turns right
D.He turns right and then picks up 2 blocks
Want to practice and check your answers?
Sign up to access all questions with instant feedback, explanations, and progress tracking.
Start Practicing Free