AP CSP Algorithms Latest 2023 Graded A+

AP CSP Algorithms Latest 2023 Graded A+ Algorithm a step-by-step set of instructions implemented by a program to develop and express solutions to a computational problem Sequencing ordering the steps of an algorithm; one of three different types of algorithms Boolean condition a decision in an algorithm based on either true or false Selection using a condition to to control the logical path taken by an algorithm; one of three different types of algorithms Iteration a loop or repeated behavior in an algorithm; one of the three different types of algorithms Pseudo code words used to organize thoughts to help plan writing code; helps programmers translate specifications into code Natural language a human language such as English, Spanish, German, etc.; as opposed to artificial terms used in programming languages Run Time the period during which a computer program is executing Reasonable time a way to analyze an algorithm in terms of the number of steps required to solve a problem; an algorithm is given this designation if the number of steps the algorithm takes is less than or equal to a polynomial function of the size of the set. Solvable problem a problem that can be solved exactly using an algorithm Unsolvable problem a problem that cannot be solved exactly using an algorithm Heuristic solution algorithmic approach applied to improve an algorithm that is based on finding solutions among all available options using a general set of rules; may result in approximate solutions instead of exact solutions; may be helpful to find solutions in reasonable time; may be helpful to find approximate solutions to unsolvable problems Undecidable problem problem in which no algorithms can be constructed to answer "yes" or "no" for all inputs Decidable problem problem in which an algorithm can be constructed to answer "yes" or "no" for all inputs Empirical analysis an evidence-based approach to the study and interpretation of information Linear search a search algorithm that finds a target by looking at each item, one at a time, until the end of the set is reached or the target is found Binary search a search algorithm that finds a target in a sorted list by starting in the middle. If the target is less than than the middle term, the algorithm then looks at the middle of the lower half. The process of narrowing the search by halves continues until the target is found or until it is determined that the target does not exist in the list.