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.
Congratulations on completing all 6 levels of Algorithms & Flowcharts! To unlock the CodeQuest: Citadel of Algorithms, you must collect all 11 Key Shards across the Coding & Computational Thinking strands. Here is your cipher fragment for Slot #1:
KEY SHARD #1
1
Slot 1 of 11
๐งฉ Coding & Computational Thinking Key Ring Tracker:Slot #1 Active
Order precise step-by-step instructions for everyday human algorithms.
Learning objective
To create and follow precise step-by-step instructions for everyday tasks.
Let's Go!
Routine: Zoom In
Look closely at these steps for making toast. Is any step out of order or missing?
Teacher note: Facilitate the Zoom In routine for 2โ3 minutes. Encourage students to connect the prompt to Form (Clear sequences enable predictable outcomes.).
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. In computing, clear sequences enable predictable outcomes. As you explore the interactive Diagram Builder Simulator below, focus on how to create a precise 5-step unplugged algorithm for an everyday task without missing steps.
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)โพ
๐ฏ Task Success Criteria (Rubric)
Foundation
Follows a 3-step pictorial instruction list with support.
Developing
Arranges mixed instruction cards into the correct order for a simple routine.
Secure (Goal)
Creates a precise 5-step unplugged algorithm for an everyday task without missing steps.
Mastery
Identifies ambiguous or missing steps in peer instructions and refines them.
๐ What A Good One Looks Like (WAGOLL)
Exemplar 1 of 2
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Unplugged Sequences.
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Unplugged Sequences.
๐
Save to Your Website Portfolio:
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
๐ฏ
Self-Assessment & Reflection
How confident are you in writing clear step-by-step instructions for others?
๐ขSecure Level
Creates a precise 5-step unplugged algorithm for an everyday task without missing steps.
Learning check
Learning Check
What is an algorithm?
Hint 1: Algorithms are step-by-step instructions for completing a task.
Hint 2: Clue: An algorithm is simply a step-by-step set of instructions.
Answer correctly to unlock the next level.
Excellent! An algorithm is simply a step-by-step set of instructions.Remember: algorithms are step-by-step instructions for completing a task.
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: Zoom In
Teacher notes: Facilitate the Zoom In routine for 2โ3 minutes. Encourage students to connect the prompt to Form (Clear sequences enable predictable outcomes.).
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: ALGO.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
algorithms
unplugged
sequence
step-by-step
Gate support
Accessibility alternative: Students may verbally explain or point to the correct answer for "What is an algorithm?" with a teacher or teaching assistant.
Complete the previous learning check to unlock this next level.
Level 2
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!
Routine: See Think Wonder
Where will the robot land if it follows these four movement arrows?
Teacher note: Facilitate the See Think Wonder routine for 2โ3 minutes. Encourage students to connect the prompt to Function (Directional algorithms guide precise spatial movement.).
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. As you explore the interactive Diagram Builder Simulator below, focus on how to write an efficient directional algorithm to navigate a maze grid around obstacles.
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)โพ
๐ฏ Task Success Criteria (Rubric)
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 (Goal)
Writes an efficient directional algorithm to navigate a maze grid around obstacles.
Mastery
Identifies alternative shorter paths and optimizes command efficiency.
๐ What A Good One Looks Like (WAGOLL)
Exemplar 1 of 2
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Robot Paths & Maps.
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Robot Paths & Maps.
๐
Save to Your Website Portfolio:
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
๐ฏ
Self-Assessment & Reflection
How easily can you trace directional commands on a grid map?
๐ขSecure Level
Writes an efficient directional algorithm to navigate a maze grid around obstacles.
Learning check
Learning Check
If a robot turns 'Right' twice from facing North, which direction is it facing?
Hint 1: Think about a compass clock: North -> East -> South.
Hint 2: Clue: Two 90-degree right turns reverse direction to South.
Answer correctly to unlock the next level.
Correct! Two 90-degree right turns reverse direction to South.Think about a compass clock: North -> East -> South.
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: See Think Wonder
Teacher notes: Facilitate the See Think Wonder routine for 2โ3 minutes. Encourage students to connect the prompt to Function (Directional algorithms guide precise spatial movement.).
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: ALGO.02.B.1.2 โ 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
grid-navigation
direction
algorithms
robot-path
Gate support
Accessibility alternative: Students may verbally explain or point to the correct answer for "If a robot turns 'Right' twice from facing North, which direction is it facing?" with a teacher or teaching assistant.
Complete the previous learning check to unlock this next level.
Level 3
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!
Routine: SplitScreenSimulator
Compare the written instructions to the flowchart diagram. Which is easier to follow?
Teacher note: Facilitate the SplitScreenSimulator routine for 2โ3 minutes. Encourage students to connect the prompt to Connection (Standard symbols represent logical flow and decision points.).
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. In computing, standard symbols represent logical flow and decision points. As you explore the interactive Diagram Builder Simulator below, focus on how to construct a complete flowchart for a decision process using standard symbols correctly.
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: SplitScreenSimulator
Teacher notes: Facilitate the SplitScreenSimulator routine for 2โ3 minutes. Encourage students to connect the prompt to Connection (Standard symbols represent logical flow and decision points.).
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: ALGO.03.B.1.3 โ Construct flowcharts using standard symbols and decision diamonds.
PYP: Connection ยท Standard symbols represent logical flow and decision points.
Learner profile: Thinker
Competency tags
flowchart
symbols
decision-diamond
logic
Gate support
Accessibility alternative: Students may verbally explain or point to the correct answer for "Which shape in a flowchart represents a decision point with Yes/No outcomes?" with a teacher or teaching assistant.
Complete the previous learning check to unlock this next level.
Level 4
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!
Routine: BeforeAfterSlider
Slide between the visual flowchart and the structured pseudocode text.
Teacher note: Facilitate the BeforeAfterSlider routine for 2โ3 minutes. Encourage students to connect the prompt to Change (Pseudocode bridges visual diagrams and formal programming languages.).
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. In computing, pseudocode bridges visual diagrams and formal programming languages. As you explore the interactive Diagram Builder Simulator below, focus on how to converts a flowchart with decision branching into formal IF/THEN/ELSE pseudocode.
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)โพ
๐ฏ Task Success Criteria (Rubric)
Foundation
Reads simple pseudocode statements with teacher guidance.
Developing
Translates a 3-step action sequence into plain-text structured pseudocode.
Secure (Goal)
Converts a flowchart with decision branching into formal IF/THEN/ELSE pseudocode.
Mastery
Identifies syntax and logic errors in complex multi-branch pseudocode.
๐ What A Good One Looks Like (WAGOLL)
Exemplar 1 of 2
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Pseudocode & Logic.
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Pseudocode & Logic.
๐
Save to Your Website Portfolio:
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
๐ฏ
Self-Assessment & Reflection
How well can you structure logic using IF/THEN keywords?
๐ขSecure Level
Converts a flowchart with decision branching into formal IF/THEN/ELSE pseudocode.
Learning check
Learning Check
Why do programmers write pseudocode before coding?
Hint 1: Pseudocode helps organize program logic in clear human terms first.
Hint 2: Clue: Exactly! Pseudocode focuses on clear logic without syntax errors.
Answer correctly to unlock the next level.
Exactly! Pseudocode focuses on clear logic without syntax errors.Pseudocode helps organize program logic in clear human terms first.
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: BeforeAfterSlider
Teacher notes: Facilitate the BeforeAfterSlider routine for 2โ3 minutes. Encourage students to connect the prompt to Change (Pseudocode bridges visual diagrams and formal programming languages.).
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: ALGO.04.B.1.4 โ Translate flowcharts into structured, language-independent pseudocode.
Accessibility alternative: Students may verbally explain or point to the correct answer for "Why do programmers write pseudocode before coding?" with a teacher or teaching assistant.
Complete the previous learning check to unlock this next level.
Level 5
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!
Routine: ClassroomWalkthrough
Guess a hidden number between 1 and 100. Is checking 1, 2, 3... as fast as splitting in half?
Teacher note: Facilitate the ClassroomWalkthrough routine for 2โ3 minutes. Encourage students to connect the prompt to Perspective (Algorithmic efficiency minimizes computational time and steps.).
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. In computing, algorithmic efficiency minimizes computational time and steps. As you explore the interactive Diagram Builder Simulator below, focus on how to execute a binary search on a sorted list by repeatedly dividing the search space in half.
๐ Student Project GuideSuccess Criteria & WAGOLL (What A Good One Looks Like)โพ
๐ฏ Task Success Criteria (Rubric)
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 (Goal)
Executes a binary search on a sorted list by repeatedly dividing the search space in half.
Mastery
Explains why binary search is vastly more efficient for large sorted datasets.
๐ What A Good One Looks Like (WAGOLL)
Exemplar 1 of 2
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Efficiency & Searching.
โญ Mastering Standard
Algorithms Exemplar: Demonstration of mastering quality standards for Efficiency & Searching.
๐
Save to Your Website Portfolio:
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
๐ฏ
Self-Assessment & Reflection
Why is binary search faster than linear search for large sorted lists?
๐ขSecure Level
Executes a binary search on a sorted list by repeatedly dividing the search space in half.
Learning check
Learning Check
Which search algorithm checks every single item in order from first to last?
Hint 1: Sequential item-by-item checking is called Linear Search.
Hint 2: Clue: Linear search inspects items sequentially one by one.
Answer correctly to unlock the next level.
Correct! Linear search inspects items sequentially one by one.Sequential item-by-item checking is called Linear Search.
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: ClassroomWalkthrough
Teacher notes: Facilitate the ClassroomWalkthrough routine for 2โ3 minutes. Encourage students to connect the prompt to Perspective (Algorithmic efficiency minimizes computational time and steps.).
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: ALGO.05.B.1.5 โ Compare algorithm efficiency and contrast linear vs binary search.
PYP: Perspective ยท Algorithmic efficiency minimizes computational time and steps.
Learner profile: Knowledgeable
Competency tags
efficiency
linear-search
binary-search
step-count
Gate support
Accessibility alternative: Students may verbally explain or point to the correct answer for "Which search algorithm checks every single item in order from first to last?" with a teacher or teaching assistant.
Complete the previous learning check to unlock this next level.
Level 6
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!
Routine: See Think Wonder
If a facial recognition algorithm was only trained on light skin tones, what happens when it meets dark skin tones?
Teacher note: Facilitate the See Think Wonder routine for 2โ3 minutes. Encourage students to connect the prompt to Reflection (Ethical algorithm design requires testing edge cases and preventing bias.).
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.
Hint 1: Algorithmic bias comes from biased training data and human assumptions.
Hint 2: Clue: Algorithms inherit the biases present in their training datasets.
Answer correctly to complete this strand.
Spot on! Algorithms inherit the biases present in their training datasets.Algorithmic bias comes from biased training data and human assumptions.
Teacher setup, curriculum links and progress descriptors
Spark support
Routine: See Think Wonder
Teacher notes: Facilitate the See Think Wonder routine for 2โ3 minutes. Encourage students to connect the prompt to Reflection (Ethical algorithm design requires testing edge cases and preventing bias.).
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: ALGO.06.B.1.6 โ Test algorithms for edge cases and identify societal algorithmic bias.
Accessibility alternative: Students may verbally explain or point to the correct answer for "What causes algorithmic bias in computer decision systems?" with a teacher or teaching assistant.
We use local browser storage to save your learning progress and optional analytics cookies (Google Analytics 4 with IP masking and zero advertising signals) to help us improve our free computing lessons. Read our Cookie Policy and Privacy Policy.