Embedded Files
Lesson Resources/Links
Lesson Resources/Links
Virtual Instructions if you were absent
________________________________________
Unit 6: Algorithms
U6L1 Algorithms Solve Problems
U6L2 Algorithm Efficiency
U6L3 Unreasonable time
U6L4 Limits of Algorithms
U6L5 Parallel and Distributive Algorithms
Unit 6 Review Notes
Standards
Standards
CSP Conceptual Framework
AP - Algorithms & Programming
AAP-4 - There exist problems that the computer cannot solve, and even when the computer can solve a problem, it may not be able to do so in a reasonable amount of time.
AAP-4.A - For determining the efficiency of an algorithm:
a. Explain the difference between algorithms that run in a reasonable time and those that do not run in a reasonable time.
b. Identify situations where a heuristic solution may be more appropriate.
AAP-4.B - Explain the existence of undecidable problems in computer science.
CSTA K-12 Computer Science Standards (2017)
AP - Algorithms & Programming
3B-AP-11 - Evaluate algorithms in terms of their efficiency, correctness, and clarity.
Page updated
Google Sites
Report abuse