AP Exam Prep

Introduction

There are a number of topics that remain to be discussed prior to the AP Computed Science Principles Exam on Thursday, May 15, 2025 at noon.

We have already learned topics that are firmly within both the Ontario curriculum and the AP CSP curriculum.

The topics that remain, while interesting, have less of a complete overlap between the two curriculums.

Therefore, materials to learn these topics are provided here for you to review either in small group discussion with Mr. Gordon or independently, as time permits and as much as you choose, between now and the end of this module.

Mr. Gordon will also be available in the next module at LCS for discussion as desired (through extra Grove Time sessions until May 15).

Topics

For each topic below, a slide deck, and suggested exercises at Khan Academy are provided.

You can also use the 5 Steps to a 5 review book to read a compact summary of any of these concepts, along with further practice questions.

Analog vs. Digital Data

Get an introduction to the concept:

Then, dive in to learn more:

• Khan Academy has a really nice interactive page where you can experiment with sampling and analog to digital conversion.

• Please try that out, then try the related quiz after reading through that section.

Crowdsourcing and Citizen Science

Get an introduction to the concepts:

Then, dive in to learn more:

• Use this module on Khan Academy
  • Complete reading in the sections noted below:
    
• Then try the four-question practice quiz

Digital Divide

Get an introduction to the concept:

Then, dive in to learn more:

• Use this module on Khan Academy
  • Complete reading in the sections noted below:
    
• Try the four-question practice quiz

Data Encryption and Secure Internet Protocols

Get an introduction to the concept:

Then, dive in to learn more and practice:

• Review data encryption techniques on on Khan Academy.
  • Complete readings in the sections noted below:
    
• Review secure internet protocols:
  • Complete readings in the sections noted below:
    

NOTE

The TLS negotiation process, while interesting, is not on the AP CSP exam.

Heuristics and Undecidable Problems

NOTE

The slides below make use of Big-O notation.

Formal analysis of algorithmic efficiency (Big-O) is not on the AP exam.

However, if you’d like to better understand the topic, this short video on time complexity of algorithms is worth your time.

Get an introduction to the concept:

Then, dive in to learn more and practice:

• Review Solving hard problems from Khan Academy
  • Complete readings in the sections noted below:
    

NOTE

The Undecidable problems reading contains a great example, but with far more detail than you’ll need to know for the AP CSP exam.

Parallel and Distributed Computing

Get an introduction to the concept:

Then, dive in to learn more and practice:

• Review Parallel and Distributed Computing from Khan Academy
  • Complete readings in the sections noted below: