|
Poyen School |
| Problem Solving |
|
Design & implementation of computer
The learner will be able to analyze and interpret graphs, charts, and tables in the design and implementation of a computer program.
|
|
Write an algorithm
The learner will be able to write an algorithm to solve mathematical problems using formulas, equations, and functions.
|
|
Boolean Operators
The learner will be able to analyze and interpret truth tables from basic statements using Boolean operators (AND, OR, XOR, and NOT).
|
|
Algorithm: Math Model
The learner will be able to write an algorithm from a mathematical model.
|
| Program Design |
|
Translate math to computer statement
The learner will be able to translate a mathematical expression into a computer statement, which involves writing assignment statements using the order of operations.
|
|
Implement conditional statements
The learner will be able to implement conditional statements that include if/then/else, case statements, and Boolean logic.
|
|
Decision and Sequence
The learner will be able to define and differentiate Decision (selection) and Sequence (process).
|
|
Flowchart and pseudocode
The learner will be able to the student will represent an algorithm representation as a flowchart and in pseudocode.
|
|
Flowchart terminology
The learner will be able to use flowchart terminology, such as terminals (starts and stops), subroutines, and connectors.
|
|
Develop recursive relationships
The learner will be able to develop recursive relationships from mathematical models (e.g. arithmetic and geometric sequences).
|
|
Variable data types
The learner will be able to define and use variable data types (integers, real, character).
|
| Program Implementation |
|
Create an array
The learner will be able to using a spreadsheet program, create and array.
|
|
Recursions and loops
The learner will be able to create functions using recursions and loops.
|
|
Implement worksheet functions
The learner will be able to locate, categorize, and implement worksheet functions.
|
|
Constraints
The learner will be able to create constraints to validate cell entries.\.
|
|
Sort data: bubble, quick, shell
The learner will be able to using a spreadsheet program, sort data using various methods (e.g., bubble, quick, and shell).
|
|
Utilize an array
The learner will be able to create, edit, and execute a program utilizing an array.
|
|
Loops
The learner will be able to create, edit, and execute programs using loops.
|
|
Programs to execute math formulas
The learner will be able to create, edit, and execute programs to calculate mathematical formulas, such as the quadratic formula, and volume of a simple solid.
|
|
Functional programs
The learner will be able to develop functional programs from algorithms developed from the mathematical models.
|
|
Display modes
The learner will be able to create programs using various display modes (including tables and graphs).
|
|
Programming commands
The learner will be able to locate, categorize, and implement programming commands.
|
|
Subroutines to reduce keystrokes/memory
The learner will be able to use subroutines to reduce keystrokes and memory use.
|
| Data Manipulation and Testing |
|
Name a range
The learner will be able to name a range (one cell or a group of cells) and use the name to select cells.
|
|
Scenario tool
The learner will be able to using the Scenario tool, estimate best-case or worst-case scenarios.
|
|
Compare results
The learner will be able to compare results from mathematical formulas to their program equivalent.
|
|
Troubleshooting techniques
The learner will be able to identify and eliminate error messages using troubleshooting techniques (debug).
|
|
Error types
The learner will be able to understand and differentiate the different error types (syntax, runtime, and logic).
|
|
Scenarios
The learner will be able to design and investigate best-case and worst-case scenarios of a program.
|