AP CS Principles Exam Review - Algorithmic Efficiency and Undecidable Problems

This video goes over a couple of exam problems about Algorithmic Efficiency and Undecidable Problems to help you prepare for the AP Computer Science Principles exam.

This also starts by covering these concepts in some depth on their own. You can skip directly to 6:52 if you want to jump straight to the practice problems!

In my opinion, this is the most difficult part of the current AP CSP curriculum; it's often math-heavy and some of the topics are quite complex. However, once you get the basics here, you should be fine, since it doesn't cover these topics in too much depth, despite their complexity.

Pardon the audio issues in the first 7 minutes; it gets better after that section!

Chapters:
0:00 Intro
0:10 Overview
0:50 Concepts: Polynomial Efficiency
3:05 Concepts: Log and Constant Efficiency
4:43 Concepts: Exponential and Factorial Efficiency
6:52 Practice: Execution Time
9:02 Practice: Algorithmic Efficiency
11:22 Practice: Algorithmic Efficiency 2
12:37 Practice: Algorithmic Efficiency 3
17:00 Practice: Heuristics
18:38 Practice: Heuristics 2
20:49 Practice: Undecidable Problems
22:13 Practice: The Halting Problem
24:47 Practice: Undecidable Problems 2

Intro/Outro Music: Friendly Neighbors