Applying computer science to learning
Imagine that learning is like traversing a graph If you're starting at [A] and you want to get to [K], there are several strategies: Depth first search Explore one path fully, then backtrack. Ex: A B ΓΑΙ 2 Breadth first search Check everything on the Same level, then go deeper. E Advantages: More like real life. Also, Pareto's Principle? Disadvantages: Requires more memory (better notes) Advantages: You can focus on one thing at a time. Disadvantages: Hard
- to know when to