Home
Subjects
Textbook solutions
Create
Study sets, textbooks, questions
Log in
Sign up
Upgrade to remove ads
Only $35.99/year
AP Computer Science Principles Final Exam Review
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
Terms in this set (33)
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
Not reasonable time
Usually exponential in the number of steps, like doubling every time your input grows by one
Heuristic
using a "rule" to guide an algorithm, like always walking toward the north star if you were stuck in a forest
Undecidable
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
Linear vs binary search
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
APIs
Application Programming Interface, how you define libraries and call them
Public key encryption
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.
Sets with similar terms
AP Computer Science Principles Final Exam Review
25 terms
AP CSP Exam Preparation Vocab
39 terms
APCSP
61 terms
tech skillz vocal
30 terms
Sets found in the same folder
AP CSP Exam Review Vocab
124 terms
APCS Principles Vocab Review 2022
93 terms
APCS Principles Internet Review
56 terms
AP Computer Science Principles Unit 2 Test
30 terms
Other sets by this creator
CS Awesome - Unit 2 Vocabulary
37 terms
CS Awesome - Unit 3 Vocabulary
12 terms
CS Awesome - Unit 1 Vocabulary
30 terms
Recursion Study Guide Questions
20 terms
Verified questions
COMPUTER SCIENCE
Write a program that can be used as a math tutor for a young student. The program should display two random numbers that are to be added, such as: $$ \begin{array}{r}{247} {+ 129} \hline$\end{array}$ $$ The program should wait for the student to enter the answer. If the answer is correct, a message of congratulations should be printed. If the answer is incorrect, a message should be printed showing the correct answer.
COMPUTER SCIENCE
Write a program that asks the user for a positive integer no greater than 15. The program should then display a square on the screen using the character ‘X’. The number entered by the user will be the length of each side of the square. For example, if the user enters 5, the program should display the following: XXXXX XXXXX XXXXX XXXXX XXXXX If the user enters 8, the program should display the following: XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX XXXXXXXX
COMPUTER SCIENCE
Change the Account class so that it also lets a user open an account with just a name and an account number, and a starting balance of zero. Change the main method of the Banking class to show this new capability.
COMPUTER SCIENCE
In the Flipping Pancakes box, the original algorithm given requires at most 2n – 3 flips in the worst case. The claim is made that the new algorithm, which requires at most (5n + 5)/3 flips, is a better algorithm. How many pancakes do you need to have before the second algorithm is indeed faster? (Use a calculator or spreadsheet.)
Other Quizlet sets
Hell Part 1
65 terms
Health Information: Test 3
57 terms
Health Information: Test 3
57 terms
APCSP Exam Vocabulary Review
22 terms
Related questions
QUESTION
What is the correct way to declare an integer variable named "score"?
QUESTION
Android: When a dialog is requested for the first time, which method Android call from your Activity ?
QUESTION
(T/F) Two separate functions in the same program may have local variables with the same name.
QUESTION
What makes Math, Science and Computer Science possible?