[DLIT] (6) 8 :
2) Define a process as a function.
Example: Functions or sets of steps combined to produce a process: turning off your alarm + getting out of bed + brushing your teeth + getting dressed = morning routine.
[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) 27 :
21) Identify varying data structures/systems and methods of classification, including decimal and binary.
Examples: Difference between a bit and a byte, bit representation, pixels.
[DLIT] (7) 7 :
1) Create a function to simplify a task.
Example: Get a writing utensil, get paper, jot notes can collectively be named "note taking".
[DLIT] (7) 10 :
4) Design a complex algorithm that contains sequencing, selection or iteration.
Examples: Lunch line algorithm that contains parameters for bringing your lunch and multiple options available in the lunch line.
[DLIT] (7) 11 :
5) Solve a complex problem using computational thinking.
[DLIT] (8) 7 :
1) Design a function using a programming language that demonstrates abstraction.
Example: Create a program that utilizes functions in an effort remove repetitive sequences of steps.
[DLIT] (8) 11 :
5) Discuss the efficiency of an algorithm or technology used to solve complex problems.
[DLIT] (8) 13 :
7) Create a program that includes selection, iteration, or abstraction, and initializes, and updates, at least two variables.
Examples: Make a game, interactive card, story, or adventure game.