Please enable JavaScript to use CodeHS

Standards Mapping

for Natrona Computer Programming 2

15

Standards in this Framework

8

Standards Mapped

53%

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.16 Debugging Strategies
L1.AP.M.01
Decompose problems into smaller components through systematic analysis, using constructs such as procedures, modules, and/or objects.
  1. 1.7 Top Down Design and Decomposition in Karel
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.
  1. 7.1 Intro to Lists/Arrays
  2. 7.2 Indexing Into an Array
  3. 7.3 Adding/Removing From an Array
  4. 7.4 Array Length and Looping Through Arrays
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. 4.4 If Statements
  2. 4.6 For Loops in JavaScript
  3. 4.7 General For Loops
  4. 4.8 For Loop Practice
  5. 4.10 While Loops
  6. 4.11 Loop and a Half
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).
  1. 4.6 For Loops in JavaScript
  2. 4.8 For Loop Practice
  3. 7.5 Iterating Over an Array
  4. 7.6 Finding an Element in a List
  5. 7.7 Removing an Element From an Array
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. 7.1 Intro to Lists/Arrays
  2. 7.2 Indexing Into an Array
  3. 7.3 Adding/Removing From an Array
  4. 7.4 Array Length and Looping Through Arrays
L2.AP.M.01
Construct solutions to problems using student-created components, such as procedures, modules, and/or objects.
  1. 5.1 Functions and Parameters 1
  2. 5.2 Functions and Parameters 2
  3. 5.3 Functions and Parameters 3
  4. 5.4 Functions and Return Values 1
  5. 5.5 Functions and Return Values 2
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. 7.1 Intro to Lists/Arrays
L2.AP.C.01
Trace the execution of recursion, illustrating output and changes in values of named variables.