Please enable JavaScript to use CodeHS

Standards Mapping

for Natrona Computer Programming 2

15

Standards in this Framework

9

Standards Mapped

60%

Mapped to Course

Standard Lessons
L2.AP.PD.01
Plan and develop programs that will provide solutions to a variety of users using a software life cycle process.
L2.AP.PD.02
Use version control systems, integrated development environments (IDEs), and collaborative tools and practices (e.g., code documentation) in a group software project.
L1.AP.PD.03
Use debugging tools to identify and fix errors in a program.
  1. 1.1 Introduction to Programming With Karel
  2. 1.2 More Basic Karel
L1.AP.M.01
Decompose problems into smaller components through systematic analysis, using constructs such as procedures, modules, and/or objects.
  1. 1.4 Functions in Karel
  2. 1.6 Top Down Design and Decomposition in Karel
  3. 7.1 Functions and Parameters 1
  4. 7.4 Functions and Return Values 1
  5. 25.8 Intro to Objects/Maps
L2.AP.PD.05
Develop and use a series of test cases to verify that a program performs according to its design specifications.
  1. 12.1 Project Prep and Development
L1.DA.S.02
Evaluate the trade-offs in how data elements are organized and where data is stored.
  1. 25.1 Intro to Lists/Arrays
  2. 25.11 When Do I Use an Object?
  3. 25.12 Intro to Sets
  4. 25.13 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.
  1. 5.9 While Loops
  2. 5.10 Loop and a Half
  3. 6.1 Control Structures Challenges
L2.AP.PD.04
Evaluate key qualities of a program through a process such as a code review (e.g., qualities could include correctness, usability, readability, efficiency, portability, and scalability).
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).
L2.AP.A.03
Evaluate algorithms (e.g., sorting, searching) in terms of their efficiency, correctness, and clarity.
L1.AP.V.01
Use lists to simplify solutions, generalizing computational problems instead of repeatedly using simple variables.
  1. 25.1 Intro to Lists/Arrays
  2. 25.2 Indexing Into an Array
  3. 25.3 Adding/Removing From an Array
L2.AP.M.01
Construct solutions to problems using student-created components, such as procedures, modules, and/or objects.
  1. 1.4 Functions in Karel
  2. 7.1 Functions and Parameters 1
  3. 7.4 Functions and Return Values 1
  4. 8.1 Functions Challenges
  5. 11.1 Breakout
L2.AP.PD.06
Explain security issues that might lead to compromised computer programs.
L2.AP.V.01
Compare and contrast simple data structures and their uses (e.g., lists, stacks, queues, arrays, dynamic arrays, objects).
  1. 25.1 Intro to Lists/Arrays
  2. 25.3 Adding/Removing From an Array
  3. 25.4 Array Length and Looping Through Arrays
  4. 25.8 Intro to Objects/Maps
  5. 25.11 When Do I Use an Object?
  6. 25.12 Intro to Sets
  7. 25.13 Intro to Grids
  8. 25.16 Data Structures Challenges
L2.AP.C.01
Trace the execution of recursion, illustrating output and changes in values of named variables.
  1. 3.2 Variables
  2. 7.1 Functions and Parameters 1
  3. 7.2 Functions and Parameters 2
  4. 7.4 Functions and Return Values 1
  5. 7.5 Functions and Return Values 2