Algorithmic Strategies: Recursive backtracking, dynamic programming, hueristics

ACM Body of Knowledge

• AL/Algorithmic Strategies

  • Topics:

    • [Core-Tier1]

      • Recursive backtracking

      • Dynamic Programming

    • [Core-Tier2]

      • Heuristics

  • Learning Outcomes:

    • [Core-Tier1]

      • 4. Use recursive backtracking to solve a problem such as navigating a maze. [Usage]

      • 5. Use dynamic programming to solve an appropriate problem. [Usage]

      • 6. Determine an appropriate algorithmic approach to a problem. [Assessment]

    • [Core-Tier2]

      • 7. Describe various heuristic problem-solving methods. [Familiarity]

Lesson

Key Resources

• Textbook

  • Chapter 3. Recursion.

    • When reading textbooks, use the SQ3R technique.

• Brilliant Course

  • Dynamic Programming

• Tutorial

  • Recursion Basics

    • Tower of Hanoi

    • Fibonacci Series

• Udemy

• 1. Recursion (17:26) scope. stack overflow, stack vs. heap, factorial, Towers of Hanoi

• Topics

  • Recursive backtracking

    • Recursion GeeksforGeeks

    • Recursion MIT 6.005

  • Dynamic Programming

    • Dynamic Programming tutorialspoint

    • Backtracking, Memoization & Dynamic Programming! Pawan Bhadauria

    • Demystifying Dynamic Programming

  • Heuristics

    • Problem solving strategies IPSY102

      • Problem solving | Processing the Environment Khan Academy (5:50)

      • Decomposition wikipedia

Additional Resources

• Problem-Solving Strategies: Algorithms and Heuristics education.com

Test Yourself

Exercise Resources