Algorithms in Everyday Life: Step-by-Step Instructions for Computers and People
Grade 2 · CS & Digital Fluency · NYS 2-3.CT.1 · 45 Minutes
NYS-Aligned Standard
2-3.CT.1 — Create a simple algorithm to solve a problem, and explain how the instructions are carried out in a computer program. NYS Computer Science and Digital Fluency Learning Standards (2020)
Learning Objectives — “I Can” Statements
- I can explain what an algorithm is using examples from everyday life.
- I can write a step-by-step algorithm that a classmate can follow exactly.
- I can identify what happens when one step is missing from an algorithm.
Essential Question
If you wanted a robot to make a peanut butter sandwich, what instructions would you need to give?
Lesson Sequence
Hook / Warm-Up (8 min)
- “Sandwich Algorithm” demonstration (classic CS activity — original execution): Teacher asks a student to give instructions to make a sandwich. Teacher follows them LITERALLY (e.g., if student says “put peanut butter on bread,” teacher holds the jar on top of the bread). Hilarity ensues.
- Key lesson: “Computers follow instructions EXACTLY. An algorithm must be precise, in order, and complete.”
Direct Instruction (10 min)
- Define: Algorithm = a precise, step-by-step set of instructions to solve a problem
- Introduce the 3 rules of a good algorithm: (1) Each step is clear, (2) Steps are in the right order, (3) No steps are missing
- Show two algorithms: one with a missing step (ambiguous), one complete. Students identify the problem.
Guided Practice (12 min)
- Class writes an algorithm together: “How to get a book from the library shelf.”
- Students test the algorithm by acting it out. Find any missing steps and revise.
- Introduce the idea of “debugging” — fixing a broken algorithm.
Independent Practice (10 min)
Students write their own algorithm for one of: (a) brushing teeth, (b) tying shoes, (c) putting on a backpack. Must have at least 5 precise steps. Partner follows their algorithm — find any bugs.
Closure (5 min)
Exit ticket: “What is an algorithm? Give one example from your life.”
SDI & Differentiation Block
Supports for MLLs/ELLs
Entering/Emerging (NYSESLAT Levels 1–2):
- Provide sequence picture cards for “tying shoes” to put in order
- Sentence frame: “First, ___. Next, ___. Then, ___. Last, ___.”
- Allow drawing with arrows for each step
Transitioning/Expanding (NYSESLAT Levels 3–4):
- Vocabulary: algorithm, step, precise, order, instruction
- Allow student to describe algorithm verbally to teacher before writing
Supports for Students with IEPs
SDI Adaptation Dimensions: content, methodology, delivery
- Content: Reduce to 3-step algorithm; use a provided template with numbered boxes
- Methodology: Use physical props for the sandwich/shoe activity; hands-on sequencing
- Delivery: Allow verbal algorithm dictated to teacher; extended time; pre-numbered template
Suggested Placement: ICT, Resource Room
Answer Key / Model Response
Exit ticket: “An algorithm is a set of step-by-step instructions. One example: getting dressed in the morning — first put on underwear, then shirt, then pants, then socks, then shoes.”
Alignment Record
| Field | Value |
|---|---|
| Standard Code | 2-3.CT.1 |
| Standard Text | Create a simple algorithm to solve a problem, and explain how the instructions are carried out in a computer program. |
| Framework | NYS Computer Science and Digital Fluency Learning Standards (2020) |
| Source | nysed.gov — NYS CS & Digital Fluency Learning Standards (2020) |
| Confidence | High Confidence |
| Validation Notes | Code 2-3.CT.1 confirmed from NYS CS & Digital Fluency framework (2020). CT = Computational Thinking; grade band 2–3 confirmed. |