Standards in this Framework
Standards Mapped
Mapped to Course
| Standard | Lessons |
|---|---|
|
L1.AP.PD.03
Use debugging tools to identify and fix errors in a program. |
|
|
L1.AP.M.01
Decompose problems into smaller components through systematic analysis, using constructs such as procedures, modules, and/or objects. |
|
|
L2.AP.PD.05
Develop and use a series of test cases to verify that a program performs according to its design specifications. |
|
|
L1.DA.S.02
Evaluate the trade-offs in how data elements are organized and where data is stored. |
|
|
L1.AP.C.01
Justify the selection of specific control structures when tradeoffs involve implementation, readability, and program performance, and explain the benefits and drawbacks of choices made. |
|
|
L2.AP.A.01
Critically examine and trace classic algorithms. Use and adapt classic algorithms to solve computational problems (e.g., selection sort, insertion sort, binary search, linear search). |
|
|
L1.AP.V.01
Use lists to simplify solutions, generalizing computational problems instead of repeatedly using simple variables. |
|
|
L2.AP.M.01
Construct solutions to problems using student-created components, such as procedures, modules, and/or objects. |
|
|
L2.AP.V.01
Compare and contrast simple data structures and their uses (e.g., lists, stacks, queues, arrays, dynamic arrays, objects). |
|
