AP CS Principles Exam Review - Algorithmic Efficiency and Undecidable Problems

Sdílet
Vložit
  • čas přidán 15. 06. 2024
  • 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

Komentáře • 14

  • @ronaldzhao
    @ronaldzhao Před měsícem

    you saved me on this ap test today 😭forever grateful

  • @iccyfn
    @iccyfn Před 2 měsíci +1

    thanks

  • @Yourhitmam
    @Yourhitmam Před měsícem +1

    Tank u

  • @ishratpatel8981
    @ishratpatel8981 Před měsícem +1

    We didn’t learn any of this in my class this year. Is this still in the curriculum this year? (2024) will it be on the test?

    • @Flavkupe
      @Flavkupe  Před měsícem

      I didn't teach AP CSP this year (2023-2024) but it does appear to still be in the Course Description PDF for this year: apcentral.collegeboard.org/media/pdf/ap-computer-science-principles-course-and-exam-description.pdf.
      It looks to be sections 3.9 (page 86), 3.17 (page 101) and 3.18 (page 103). Code.org covers these in the very last unit this year (Unit 10).
      The good news is that since undecidability and efficiency are such complex topics, usually the problems are somewhat forgiving on these topics. I recommend going thru the above pages of that PDF and trying your best to understand just the points under "Essential Knowledge" and "Learning Objective" for these. The questions usually hit up those points. Then after that, check if you understand the problems in this video. You can probably find some others on these topics online for AP CSP.

  • @niya4417
    @niya4417 Před měsícem +1

    ofc the one thing i dont understand has the longest review video

    • @Lj-ov6zn
      @Lj-ov6zn Před měsícem +1

      it's okay still 1.5 hours till the exam

    • @lucianamolina6205
      @lucianamolina6205 Před měsícem

      @@Lj-ov6zn chat are we cooked

    • @christakigawa
      @christakigawa Před měsícem

      @@lucianamolina6205we need to be cooking

    • @Lj-ov6zn
      @Lj-ov6zn Před měsícem

      @@lucianamolina6205 it wasn't that bad tbh, just part b on the writing was hard

    • @Flavkupe
      @Flavkupe  Před měsícem

      @@Lj-ov6zn hopefully the material on these vids was useful for the exams, and still mostly relevant?