PRAXIS 5652: II.A.2
CodeHS Lessons
Know how to use pattern recognition, problem decomposition, and abstraction to develop an algorithm
| Standard |
| 1.7 Top Down Design and Decomposition in Karel |
| 1.10 Super Karel |
| Standard |
| 1.7 Top Down Design and Decomposition in Karel |
| 1.10 Super Karel |
| Standard |
| 2.10 Using the Math Class |
| 4.3 Developing Algorithms Using Strings |
| 6.4 Developing Algorithms Using Arrays |
| Standard |
| 8.1 What is an Algorithm? |
| Standard |
| 3.10 Using the Math Class |
| 6.3 Developing Algorithms Using Strings |
| 9.1 What is an Algorithm? |
| Standard |
| 1.6 Top Down Design and Decomposition in Karel |
| 1.9 Super Karel |
| Standard |
| 1.6 Top Down Design and Decomposition in Karel |
| 1.9 Super Karel |
| Standard |
| 1.6 Top Down Design and Decomposition in Karel |
| 1.9 Super Karel |
| Standard |
| 9.1 What is an Algorithm? |
| Standard |
| 11.1 What is an Algorithm? |
| Standard |
| 9.1 What is an Algorithm? |
| Standard |
| 8.10 Using the Math Class |
| 10.3 Developing Algorithms Using Strings |
| 13.4 Developing Algorithms Using Arrays |
| Standard |
| 8.10 Using the Math Class |
| 10.3 Developing Algorithms Using Strings |
| 12.4 Developing Algorithms Using Arrays |
| Standard |
| 1.6 Top Down Design and Decomposition in Karel |
| 1.9 Super Karel |
