Thinking in Steps: Algorithms, Flowcharts, Pseudocode
Decompose a task into ordered steps and represent it as a flowchart and as pseudocode.
- Sequencing a Familiar TaskBy the end you can decompose a familiar task into an ordered list of steps, explain why a particular pair of steps cannot be swapped, and use the word algorithm for what that ordered list actually is.
- Flowchart Symbols and Building FlowchartsBy the end you can name what each flowchart shape means, interpret a flowchart someone else drew, and build a flowchart for a familiar task and for your walking animation's up-arrow script.
- Writing PseudocodeBy the end you can write pseudocode for a task as a numbered list of exact steps, state a benefit of writing it before you build, and explain why a vague instruction causes problems that a precise one doesn't.
- Turning CornersBy the end you can turn Robo to face a new direction without moving it, and build a program that walks it around one or more corners to the flag.
- Plan It, Then Build ItBy the end you can write numbered pseudocode for a maze level before touching any blocks, then build it and use Robo's run to check whether your plan was exact enough.
- Gems and the Shortest WayBy the end you can build a program that collects every gem on a level and reaches the flag, in a tidy number of blocks.
- Do It AgainBy the end you can shorten a program by wrapping a repeated block in a repeat block, and state what repeat N does in your own words.
- Until You Get ThereBy the end you can build a program that reaches an unknown-length goal using repeat until goal, without counting the squares first.
- Unit ChallengeBy the end you will have shown you can build a maze program using everything this unit taught, plan it three ways, and say back what each part of the unit means.