[DLIT] (3) 26 :
20) Compare and contrast human and computer performance on similar tasks to understand which is better suited to the task.
Examples: Sorting alphabetically, finding a path across a cluttered room.
[DLIT] (4) 22 :
16) Gather and organize data to answer a question using a variety of computing and data visualization methods.
Examples: Sorting, totaling, averaging, charts, and graphs.
[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] (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] (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.