FL 9-12: SC.912.CS-CS.2.1
CodeHS Lessons
Explain intractable problems and understand that problems exists that are computationally unsolvable (e.g., classic intractable problems include the Towers of Hanoi and the Traveling Salesman Problem -TSP).
| Standard |
| 7.6 Finding an Element in a List |
| Standard |
| 7.4 For Loops and Lists |
| Standard |
| 7.6 Finding an Element in a List |
| Standard |
| 7.6 Finding an Element in a List |
| Standard |
| 6.6 Finding an Element in a List |
| Standard |
| 6.6 Finding an Element in a List |
| Standard |
| 5.3 For Loops and Lists |
| Standard |
| 6.3 For Loops and Lists |
| Standard |
| 4.3 For Loops and Lists |
| Standard |
| 4.3 For Loops and Lists |
| Standard |
| 7.3 For Loops and Lists |
| Standard |
| 4.6 Finding an Element in a List |
