AP Computer Science Principles 160 EXAM Questions with 100% Correct Answers | Verified | Updated 2024

Overflow - ️️error that results when the number of bits is not enough to hold the number, like a car's odometer "rolling over" Round-off - ️️error that results when the number of bits is not enough to represent the actual number, like 3 digits to represent π as 3.14 Lossy - ️️Compressing data in a way that throws some data away and makes it almost impossible to recover the original, great compression, like JPEG images Lossless - ️️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 Metadata - ️️data about data, like a camera storing the location, aperture, shutter speed, etc. for a digital photo Sequencing - ️️code flows line by line, one after another, like a recipe Selection - ️️a boolean condition to determine which of two algorithmic paths are taken, aka if-then Iteration - ️️using a looping control structure, like while, for, foreach, repeat, repeat-until, etc. Reasonable Time - ️️polynomial in the number of steps an algorithm takes in the worst case based on the input size