Standards Mapping

L1.AP.PD.03

Use debugging tools to identify and fix errors in a program.

• 1.1 Introduction to Programming With Karel
• 1.2 More About Karel

L1.AP.M.01

Decompose problems into smaller components through systematic analysis, using constructs such as procedures, modules, and/or objects.

• 1.4 Functions in Karel
• 1.6 Top Down Design and Decomposition in Karel
• 8.1 Parameters
• 8.2 Return Values

L2.AP.PD.05

Develop and use a series of test cases to verify that a program performs according to its design specifications.

• 13.1 Project Prep and Development

L1.DA.S.02

Evaluate the trade-offs in how data elements are organized and where data is stored.

• 22.1 Intro to Sets
• 22.2 Intro to Grids

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.

• 6.6 While Loops
• 6.7 The Break Statement
• 7.1 Control Structures Challenges

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.

• 1.4 Functions in Karel
• 3.7 Basic Functions
• 8.1 Parameters
• 8.2 Return Values
• 9.1 Functions Challenges
• 12.1 Breakout

L2.AP.V.01

Compare and contrast simple data structures and their uses (e.g., lists, stacks, queues, arrays, dynamic arrays, objects).

• 22.1 Intro to Sets
• 22.2 Intro to Grids