Please enable JavaScript to use CodeHS

NY 9-12: 9-12.CT.6

  1. Frameworks
  2. New York 9-12

CodeHS Lessons

Demonstrate how at least two classic algorithms work and analyze the trade-offs related to two or more algorithms for completing the same task.

Intro to Computer Science in Python
Standard
5.1 While Loops
7.1 Indexing
7.2 Slicing
7.3 Immutability
12.2 Methods
12.3 Built-In Methods
12.5 Class Variables vs. Instance Variables

AP Computer Science A (Nitro)
Standard
7.5 Searching
7.6 Sorting
10.2 Recursive Searching
10.3 Recursive Sorting

AP Computer Science Principles in JavaScript
Standard
7.5 Iterating Over an Array

AP Computer Science Principles in Python
Standard
7.4 List Methods
33.1 Indexing
33.2 Slicing
33.3 Immutability
27.2 Methods
27.3 Built-In Methods
27.5 Class Variables vs. Instance Variables

AP Computer Science Principles: Cybersecurity
Standard
7.5 Iterating Over an Array

Mobile Apps
Standard
8.1 Conditionals and State Change
8.2 Conditionals using Parameters

Data Science
Standard
1.5 Series and Central Tendency
1.6 Measures of Spread

AP Computer Science A (Mocha)
Standard
8.2 Linear Search
8.3 Binary Search
8.4 Selection Sort
8.5 Insertion Sort

IB Computer Science Standard Level
Standard
14.5 Searching
14.6 Sorting
17.2 Recursive Searching
17.3 Recursive Sorting

IB Computer Science Higher Level (Year One)
Standard
13.5 Searching
13.6 Sorting
15.2 Recursive Searching
15.3 Recursive Sorting