[DLIT] (5) 8 :
2) Create an algorithm to solve a problem while detecting and debugging logical errors within the algorithm.
Examples: Program the movement of a character, robot, or person through a maze.
Define a variable that can be changed or updated.
[DLIT] (5) 9 :
3) Create an algorithm that is defined by simple pseudocode.
[DLIT] (5) 10 :
4) Create a simple pseudocode.
[DLIT] (5) 11 :
5) Develop and recommend solutions to a given problem and explain the process to an audience.
[DLIT] (6) 11 :
5) Identify algorithms that make use of sequencing, selection or iteration.
Examples: Sequencing is doing steps in order (put on socks, put on shoes, tie laces); selection uses a Boolean condition to determine which of two parts of an algorithm are used (hair is dirty? True, wash hair; false, do not); iteration is the repetition of part of an algorithm until a condition is met (if you're happy and you know it clap your hands, when you're no longer happy you stop clapping).
[DLIT] (6) 12 :
6) Identify steps in developing solutions to complex problems using computational thinking.
[DLIT] (6) 13 :
7) Describe how automation works to increase efficiency.
Example: Compare the amount of time/work to hand wash a car vs. using an automated car wash.
[DLIT] (7) 9 :
3) Create algorithms that demonstrate sequencing, selection or iteration.
Examples: Debit card transactions are approved until the account balance is insufficient to fund the transaction = iteration, do until.
[DLIT] (7) 12 :
6) Create and organize algorithms in order to automate a process efficiently.
Example: Set of recipes (algorithms) for preparing a complete meal.
[DLIT] (8) 11 :
5) Discuss the efficiency of an algorithm or technology used to solve complex problems.
[DLIT] (8) 12 :
6) Describe how algorithmic processes and automation increase efficiency.