Khan Academy (Due by April 21) https://www.khanacademy.org
Modules
The Internet
Algorithms
Data Analysis
Unit 6: Algorithms
U6L1 Algorithms Solve Problems
U6L2 Algorithm Efficiency
U6L3 Unreasonable time
U6L4 Limits of Algorithms
U6L5 Parallel and Distributive Algorithms
CSP Conceptual Framework
CSN-2 - Parallel and distributed computing leverages multiple computers to more quickly solve complex problems or process large data sets.
CSN-2.A - Compare problem solutions that use sequential, parallel, and distributed computing.
CSN-2.B - Determine the efficiency of sequential and parallel solutions.
CSTA K-12 Computer Science Standards (2017)
AP - Algorithms & Programming
3B-AP-11 - Evaluate algorithms in terms of their efficiency, correctness, and clarity.
In this lesson, students explore the benefits and limitations of parallel and distributed computing. First, they discuss the way human problem-solving changes when additional people lend a hand. Then they run a series of demonstrations that show how simple tasks like sorting cards get faster when more people help, but there is a limitation to the efficiency gains. Later in the lesson students watch a video about distributed computing that highlights the ways distributed computing can help tackle new kinds of problems. To conclude the lesson students record new vocabulary in their journals and discuss any open questions.
This lesson is a quick tour of the challenges and benefits of parallel and distributed computing. It caps off the unit to showcase ways these techniques are being used to push the boundaries of how efficiently computers can solve problems.