Ten-term algorithm vocabulary set for grades 3-8¶
Element · All elements
Evidence · no claims cited
Description¶
The deck specifies a vocabulary set labeled "Words to teach" for algorithm lessons. It defines "Algorithm - A list of steps to finish a task", "Bug - Part of a program that does not work correctly", "Debugging - Finding and fixing problems in an algorithm or program", "Loop - The action of doing something over and over again", and "Program - An algorithm that has been coded into something that can be run by a machine". It adds decomposition, abstraction, sequencing, and pattern recognition definitions.
Design Implications¶
Context¶
Requirements¶
- Vocabulary is intended to be taught explicitly at the start of algorithm lessons, matching the session plan's introduction and vocabulary segment
Constraints¶
Target Learners¶
- Students in grades 3-8
Target Learning Goals¶
- Learning core computational thinking vocabulary including decomposition, abstraction, sequencing, and pattern recognition
Related Elements¶
- Code.org CS Fundamentals unplugged lessons: Dice Race, My Robotic Friends, Paper Planes, Plant a Seed, Tangrams
- Flowcharts as a representation for planning algorithms
- CT Boosters: 30-minute algorithmic-thinking professional learning sessions for grades 3-8
Examples¶
-
Key Sources¶
- Computational Thinking Boosters: Algorithmic Thinking 3-8. (2021). Presentation dated Jan. 12, 2021, supported by NSF grant award #1923314. https://www.nsf.gov/awardsearch/showAward?AWD_ID=1923314
Page metadata
| Field | Value |
|---|---|
type |
element |
id |
algorithm-vocabulary-ten-terms-3-8 |
title |
Ten-term algorithm vocabulary set for grades 3-8 |
description |
The deck specifies a vocabulary set labeled "Words to teach" for algorithm lessons. |
status |
review |
generated |
by process:wiki-ingest on 2026-10-09 |
trust |
unverified — no one has confirmed this page's content |
sources |
1 — computational-thinking-boosters-algorithmic-thinking-3-8-2021 |
Frontmatter is the page's machine-readable record — see the Schema & Guide.