Search
Create
Log in
Sign up
Log in
Sign up
AP CSP Unit 5: Algorithms and Simulations
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
Terms in this set (13)
model
a computer representation of an object (or system of objects) in the real world. For example, you can have a model of an airplane or a highway
simulation
an algorithm that uses models to see what will happen over time under certain conditions. For example, if you model an airplane, you might simulate wind hitting it
concerns regarding experiments in the real world
1. expensive, 2. time-consuming, 3. dangerous, 4. unethical
iterative design process
starting with a very simple model and refining that model based on their past experiences to make it more realistic for the next simulation
linear search
searching a list from one item to the next
binary search
dividing a sorted list into two pieces at each step
heuristic
polynomial-time algorithms that don't solve the problem exactly, but give a good enough approximation
optimization model
a class of models used when the user seeks to optimize some objective function subject to some constraints
undecidable statement
might be true or might be false; we don't know which
self-contradictory statement
can be neither true nor false
infinite loop
a sequence of computer instructions that repeats forever
unsolvable problem
one for which no algorithm can ever be written to find the solution
undecidable problem
one for which no algorithm can ever be written that will always give a correct true/false decision for every input value. Undecidable problems are a subcategory of unsolvable problems that include only problems that should have a yes/no answer (such as: does my code have a bug?)
;