AP Computer Science Principles Final Exam Review

error that results when the number of bits is not enough to hold the number, like a car's odometer "rolling over"

error that results when the number of bits is not enough to represent the actual number, like 3 digits to represent π as 3.14

Compressing data in a way that throws some data away and makes it almost impossible to recover the original, great compression, like JPEG images

Compressing data in a way that preserves all data away and allows full recovery of the original, good compression -- usually not as good as lossy, like PNG images

data about data, like a camera storing the location, aperture, shutter speed, etc. for a digital photo

code flows line by line, one after another, like a recipe

a boolean condition to determine which of two algorithmic paths are taken, aka if-then

using a looping control structure, like while, for, foreach, repeat, repeat-until, etc.

polynomial in the number of steps an algorithm takes in the worst case based on the input size

Usually exponential in the number of steps, like doubling every time your input grows by one

using a "rule" to guide an algorithm, like always walking toward the north star if you were stuck in a forest

A problem that is so difficult, we can't ever create an algorithm that would be able to answer yes or no for all inputs, like determining if a user's program run on some input would always stop and not run forever

Going one by one vs starting in the middle and going left/right like looking for a word in the dictionary -- binary search requires the list to be sorted in order

Application Programming Interface, how you define libraries and call them

is any cryptographic system that uses pairs of keys: public keys which may be disseminated widely, and private keys which are known only to the owner.