Please enable JavaScript to use CodeHS

MD 9-10: 10.AP.A.01

CodeHS Lessons

Develop prototypes that use algorithms (e.g., sequencing, selection, iteration, recursion, etc.) to solve computational problems by leveraging prior student knowledge and personal interest.

Standard
2.1 Challenge Problems
8.1 Functions Challenges
11.1 Breakout
Standard
2.1 Challenge Problems
9.1 Functions Challenges
12.1 Breakout
Standard
2.19 Putting Together Control Structures
13.1 Advanced Challenges with Tracy
Standard
7.5 Searching
7.6 Sorting
10.1 Recursion
Standard
13.19 Putting Together Control Structures
Standard
1.8 Challenge: Make a Keyboard
3.3 Interactive Resume Development
4.6 Challenge: Create a Survey
4.9 Challenge: Collecting User Clicks
Standard
21.1 Challenge Problems
Standard
6.1 Putting Together Control Structures
7.1 Advanced Challenges with Tracy
Standard
3.19 Putting Together Control Structures
Standard
6.19 Putting Together Control Structures
Standard
1.19 Putting Together Control Structures
15.1 Advanced Challenges with Tracy
Standard
2.1 Challenge Problems
9.1 Functions Challenges
13.1 Breakout
Standard
8.1 Putting Together Control Structures
10.1 Advanced Challenges with Tracy
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
8.1 What is an Algorithm?
8.2 Linear Search
8.3 Binary Search
8.4 Selection Sort
8.5 Insertion Sort
8.6 Advanced: Recursion
8.7 Mergesort
Standard
3.2 Challenge Problems
Standard
3.2 Challenge Problems
Standard
4.2 Challenge Problems
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
3.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
3.2 Challenge Problems
Standard
18.19 Putting Together Control Structures
Standard
5.7 Challenge: Make a Keyboard
7.3 Interactive Resume Development
8.6 Challenge: Create a Survey
8.9 Challenge: Collecting User Clicks
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
2.1 Challenge Problems
13.1 Functions Challenges
23.1 Breakout
Standard
2.1 Challenge Problems
9.1 Functions Challenges
12.1 Breakout
Standard
1.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
3.19 Putting Together Control Structures
Standard
3.20 Putting Together Control Structures
7.1 Advanced Challenges with Tracy
Standard
9.1 What is an Algorithm?
9.2 Linear Search
9.3 Binary Search
9.4 Selection Sort
9.5 Insertion Sort
9.6 Advanced: Recursion
9.7 Mergesort
Standard
1.19 Putting Together Control Structures
Standard
3.2 Challenge Problems
Standard
4.2 Challenge Problems
Standard
3.2 Challenge Problems
11.1 Breakout
Standard
9.1 What is an Algorithm?
9.2 Linear Search
9.3 Binary Search
9.4 Selection Sort
9.5 Insertion Sort
9.6 Advanced: Recursion
9.7 Mergesort
Standard
6.1 Putting Together Control Structures
7.1 Advanced Challenges with Tracy
Standard
3.2 Challenge Problems
Standard
3.2 Challenge Problems
Standard
1.19 Putting Together Control Structures
Standard
2.1 Challenge Problems
8.1 Functions Challenges
11.1 Breakout
Standard
2.1 Challenge Problems
9.1 Functions Challenges
9.1 Functions Challenges
Standard
14.5 Searching
14.6 Sorting
17.1 Recursion
Standard
13.5 Searching
13.6 Sorting
15.1 Recursion
Standard
2.22 Putting Together Control Structures
16.1 Advanced Challenges with Tracy