Learning objective
Algorithms
Algorithms & Flowcharts
Algorithms are precise step-by-step instructions or rules followed by a computer or person to solve a problem or complete a task. Flowcharts visually map out these processes using standardized symbols.
Unplugged Sequences
Order precise step-by-step instructions for everyday human algorithms.
Let's Go!
Learn
An algorithm is a step-by-step set of instructions to solve a problem or complete a task. Computers need instructions to be completely precise and in the exact right order. If a step is missing or in the wrong order, the algorithm fails.
Try it yourself
Order Everyday Algorithms
๐ Open a practice space
Or try locally: ๐ Raspberry Pi Projects
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)
๐ฏ Task Success Criteria (Rubric)
Follows a 3-step pictorial instruction list with support.
Arranges mixed instruction cards into the correct order for a simple routine.
Creates a precise 5-step unplugged algorithm for an everyday task without missing steps.
Identifies ambiguous or missing steps in peer instructions and refines them.
๐ What A Good One Looks Like (WAGOLL)
A top-tier student project for Unplugged Sequences includes:
- Core Deliverable: Order Everyday Algorithms
- Target Quality: Creates a precise 5-step unplugged algorithm for an everyday task without missing steps.
- Excellence & Polish: Identifies ambiguous or missing steps in peer instructions and refines them.
When you finish creating your project in your software, copy the share link or take a screenshot and publish it onto your student portfolio website!
Reflect
Learning check
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: Zoom In
Achievement pathway
- Foundation: Follows a 3-step pictorial instruction list with support.
- Developing: Arranges mixed instruction cards into the correct order for a simple routine.
- Secure: Creates a precise 5-step unplugged algorithm for an everyday task without missing steps.
- Mastering: Identifies ambiguous or missing steps in peer instructions and refines them.
Curriculum links
Curriculum strand: Algorithms & Programming
Outcome: AP.01.B.1.1 โ Order precise step-by-step instructions for everyday human algorithms.
PYP: Form ยท Clear sequences enable predictable outcomes.
Learner profile: Inquirer
Competency tags
Gate support
Accessibility alternative:
Teacher override: allow
Locked level
Level 2: Robot Paths & Maps
Complete the previous learning check to unlock this next level.
Robot Paths & Maps
Trace directional step-by-step paths on grid maps and predict outcomes.
Learning objective
To trace directional algorithms on grid maps and predict where a robot will land.
Let's Go!
Learn
Robots follow directional algorithms using commands like Forward, Turn Left, and Turn Right. Tracing algorithms on a grid map allows us to test instructions before running them on physical or virtual robots.
Try it yourself
Navigate the Grid Maze
๐ Open a practice space
Or try locally: ๐ Raspberry Pi Projects
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)
๐ฏ Task Success Criteria (Rubric)
Traces a 2-step arrow path (Forward, Turn Right) on a simple grid.
Predicts the endpoint of a 4-step path on a 5x5 grid.
Writes an efficient directional algorithm to navigate a maze grid around obstacles.
Identifies alternative shorter paths and optimizes command efficiency.
๐ What A Good One Looks Like (WAGOLL)
A top-tier student project for Robot Paths & Maps includes:
- Core Deliverable: Navigate the Grid Maze
- Target Quality: Writes an efficient directional algorithm to navigate a maze grid around obstacles.
- Excellence & Polish: Identifies alternative shorter paths and optimizes command efficiency.
When you finish creating your project in your software, copy the share link or take a screenshot and publish it onto your student portfolio website!
Reflect
Learning check
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: See Think Wonder
Achievement pathway
- Foundation: Traces a 2-step arrow path (Forward, Turn Right) on a simple grid.
- Developing: Predicts the endpoint of a 4-step path on a 5x5 grid.
- Secure: Writes an efficient directional algorithm to navigate a maze grid around obstacles.
- Mastering: Identifies alternative shorter paths and optimizes command efficiency.
Curriculum links
Curriculum strand: Algorithms & Programming
Outcome: AP.01.B.1.1 โ Trace directional step-by-step paths on grid maps and predict outcomes.
PYP: Function ยท Directional algorithms guide precise spatial movement.
Learner profile: Communicator
Competency tags
Gate support
Accessibility alternative:
Teacher override: allow
Locked level
Level 3: Flowcharts & Decisions
Complete the previous learning check to unlock this next level.
Flowcharts & Decisions
Construct flowcharts using standard symbols and decision diamonds.
Learning objective
To read and construct flowcharts using standard oval, rectangle, and diamond symbols.
Let's Go!
Learn
Flowcharts use standardized geometric symbols connected by directional arrows: Ovals represent Start/End points, Rectangles represent Actions or Processes, and Diamonds represent Decisions with Yes/No outcomes.
Try it yourself
Build a Decision Flowchart
๐ Open a practice space
Or try locally: ๐ Raspberry Pi Projects
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)
๐ฏ Task Success Criteria (Rubric)
Identifies the difference between Start/Stop ovals and Action rectangles.
Follows a simple flowchart with one decision diamond (Yes/No branch).
Constructs a complete flowchart for a decision process using standard symbols correctly.
Evaluates complex flowcharts with multiple decision branches for logical errors.
๐ What A Good One Looks Like (WAGOLL)
A top-tier student project for Flowcharts & Decisions includes:
- Core Deliverable: Build a Decision Flowchart
- Target Quality: Constructs a complete flowchart for a decision process using standard symbols correctly.
- Excellence & Polish: Evaluates complex flowcharts with multiple decision branches for logical errors.
When you finish creating your project in your software, copy the share link or take a screenshot and publish it onto your student portfolio website!
Reflect
Learning check
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: SplitScreenSimulator
Achievement pathway
- Foundation: Identifies the difference between Start/Stop ovals and Action rectangles.
- Developing: Follows a simple flowchart with one decision diamond (Yes/No branch).
- Secure: Constructs a complete flowchart for a decision process using standard symbols correctly.
- Mastering: Evaluates complex flowcharts with multiple decision branches for logical errors.
Curriculum links
Curriculum strand: Algorithms & Programming
Outcome: AP.02.B.1.1 โ Construct flowcharts using standard symbols and decision diamonds.
PYP: Connection ยท Standard symbols represent logical flow and decision points.
Learner profile: Thinker
Competency tags
Gate support
Accessibility alternative:
Teacher override: allow
Locked level
Level 4: Pseudocode & Logic
Complete the previous learning check to unlock this next level.
Pseudocode & Logic
Translate flowcharts into structured, language-independent pseudocode.
Learning objective
To write structured pseudocode using standard keywords like IF, THEN, ELSE, and REPEAT.
Let's Go!
Learn
Pseudocode is structured plain text that describes an algorithm without relying on specific programming syntax. It uses standard logical keywords like IF, THEN, ELSE, and REPEAT to plan program logic before writing real code.
Try it yourself
Write Pseudocode Logic
๐ Open a practice space
Or try locally: ๐ Raspberry Pi Projects
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)
๐ฏ Task Success Criteria (Rubric)
Reads simple pseudocode statements with teacher guidance.
Translates a 3-step action sequence into plain-text structured pseudocode.
Converts a flowchart with decision branching into formal IF/THEN/ELSE pseudocode.
Identifies syntax and logic errors in complex multi-branch pseudocode.
๐ What A Good One Looks Like (WAGOLL)
A top-tier student project for Pseudocode & Logic includes:
- Core Deliverable: Write Pseudocode Logic
- Target Quality: Converts a flowchart with decision branching into formal IF/THEN/ELSE pseudocode.
- Excellence & Polish: Identifies syntax and logic errors in complex multi-branch pseudocode.
When you finish creating your project in your software, copy the share link or take a screenshot and publish it onto your student portfolio website!
Reflect
Learning check
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: BeforeAfterSlider
Achievement pathway
- Foundation: Reads simple pseudocode statements with teacher guidance.
- Developing: Translates a 3-step action sequence into plain-text structured pseudocode.
- Secure: Converts a flowchart with decision branching into formal IF/THEN/ELSE pseudocode.
- Mastering: Identifies syntax and logic errors in complex multi-branch pseudocode.
Curriculum links
Curriculum strand: Algorithms & Programming
Outcome: AP.02.B.1.1 โ Translate flowcharts into structured, language-independent pseudocode.
PYP: Change ยท Pseudocode bridges visual diagrams and formal programming languages.
Learner profile: Principled
Competency tags
Gate support
Accessibility alternative:
Teacher override: allow
Locked level
Level 5: Efficiency & Searching
Complete the previous learning check to unlock this next level.
Efficiency & Searching
Compare algorithm efficiency and contrast linear vs binary search.
Learning objective
To measure algorithm efficiency and compare linear search with binary search.
Let's Go!
Learn
Not all algorithms are created equal. Linear search checks every item one by one from start to finish. Binary search works on sorted lists by checking the middle item and cutting the remaining search area in half each time, requiring far fewer steps.
Try it yourself
Compare Search Algorithms
๐ Open a practice space
Or try locally: ๐ Raspberry Pi Projects
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)
๐ฏ Task Success Criteria (Rubric)
Counts how many total steps two different algorithms take to reach a goal.
Performs a linear search by checking item by item in an unsorted list.
Executes a binary search on a sorted list by repeatedly dividing the search space in half.
Explains why binary search is vastly more efficient for large sorted datasets.
๐ What A Good One Looks Like (WAGOLL)
A top-tier student project for Efficiency & Searching includes:
- Core Deliverable: Compare Search Algorithms
- Target Quality: Executes a binary search on a sorted list by repeatedly dividing the search space in half.
- Excellence & Polish: Explains why binary search is vastly more efficient for large sorted datasets.
When you finish creating your project in your software, copy the share link or take a screenshot and publish it onto your student portfolio website!
Reflect
Learning check
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: ClassroomWalkthrough
Achievement pathway
- Foundation: Counts how many total steps two different algorithms take to reach a goal.
- Developing: Performs a linear search by checking item by item in an unsorted list.
- Secure: Executes a binary search on a sorted list by repeatedly dividing the search space in half.
- Mastering: Explains why binary search is vastly more efficient for large sorted datasets.
Curriculum links
Curriculum strand: Algorithms & Programming
Outcome: AP.03.B.1.1 โ Compare algorithm efficiency and contrast linear vs binary search.
PYP: Perspective ยท Algorithmic efficiency minimizes computational time and steps.
Learner profile: Knowledgeable
Competency tags
Gate support
Accessibility alternative:
Teacher override: allow
Locked level
Level 6: Algorithmic Bias & Optimization
Complete the previous learning check to unlock this next level.
Algorithmic Bias & Optimization
Test algorithms for edge cases and identify societal algorithmic bias.
Learning objective
To test algorithms against edge cases and evaluate how algorithmic bias impacts society.
Let's Go!
Learn
Algorithms reflect the data and assumptions of the humans who build them. Algorithmic bias occurs when computer programs produce unfair decisions due to incomplete or biased training data. Rigorous testing with edge cases ensures algorithms are fair, reliable, and secure.
Try it yourself
Audit Algorithms for Bias
๐ Open a practice space
Or try locally: ๐ Raspberry Pi Projects
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)
๐ฏ Task Success Criteria (Rubric)
Identifies an input value that causes an algorithm to give an unexpected error.
Tests algorithms using extreme and unexpected edge case inputs.
Refines algorithms to handle edge cases gracefully and explains how flawed training data creates bias.
Audits real-world automated systems for fairness, efficiency, and ethical impact.
๐ What A Good One Looks Like (WAGOLL)
A top-tier student project for Algorithmic Bias & Optimization includes:
- Core Deliverable: Audit Algorithms for Bias
- Target Quality: Refines algorithms to handle edge cases gracefully and explains how flawed training data creates bias.
- Excellence & Polish: Audits real-world automated systems for fairness, efficiency, and ethical impact.
When you finish creating your project in your software, copy the share link or take a screenshot and publish it onto your student portfolio website!
Reflect
Learning check
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: See Think Wonder
Achievement pathway
- Foundation: Identifies an input value that causes an algorithm to give an unexpected error.
- Developing: Tests algorithms using extreme and unexpected edge case inputs.
- Secure: Refines algorithms to handle edge cases gracefully and explains how flawed training data creates bias.
- Mastering: Audits real-world automated systems for fairness, efficiency, and ethical impact.
Curriculum links
Curriculum strand: Algorithms & Programming
Outcome: AP.03.B.1.1 โ Test algorithms for edge cases and identify societal algorithmic bias.
PYP: Reflection ยท Ethical algorithm design requires testing edge cases and preventing bias.
Learner profile: Reflective
Competency tags
Gate support
Accessibility alternative:
Teacher override: allow
