| GRADES | PRE-KINDERGARTEN thru 4
|
05.0.10.0.1
|
Students will classify data according to attributes
|
|
05.0.10.0.2
|
Students will solve simple counting problems
|
|
05.0.10.0.3
|
Students will use diagrams and models of simple networks that represent everyday situations
|
|
05.0.10.0.4
|
Students will identify and investigate sequences
|
|
05.0.10.0.5
|
Students will follow, devise and describe practical algorithmic procedures.
|
| GRADES | 5 thru 8
|
05.0.10.5.1
|
Students will use systemic listing and counting strategies, including simple combinations and permutations
|
|
05.0.10.5.2
|
Students will use recursive processes, including iteration, to explore and solve problems
|
|
05.0.10.5.3
|
Students will devise, describe and test algorithms for solving optimization problems.
|
| GRADES | 9 thru 12
|
05.0.10.9.1
|
Students will represent problem situations using finite graphs, matrices, sequences and recurrence relations
|
|
05.0.10.9.2
|
Students will develop, analyze, describe, invent and test algorithms
|
|
05.0.10.9.3
|
Students will define and use permutations, combinations, mathematical induction and recursion to solve combinatorial and algorithmic problems
|
|
05.0.10.9.4
|
Students will understand and use appropriate strategies to solve optimization problems.
|
| | |