AP CSP: Unit 10 - Algorithms

0.0(0)
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/17

flashcard set

Earn XP

Description and Tags

Terms from Unit 10 of AP CSP. Keep in mind that these vocabs are based on the course vocabulary list from Code.org.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

18 Terms

1
New cards

Problem

a general description of a task that can (or cannot) be solved with an algorithm

2
New cards

Algorithm

a finite set of instructions that accomplish a task

3
New cards

Sequencing

putting steps in an order

4
New cards

Selection

deciding which steps to do next

5
New cards

Iteration

a repetitive portion of an algorithm which repeats a specified number of times or until a given condition is met

6
New cards

Efficiency

a measure of how many steps are needed to complete an algorithm

7
New cards

Linear Search

a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked

8
New cards

Binary Search

a search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated

9
New cards

Reasonable Time

Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time

10
New cards

Unreasonable Time

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time

11
New cards

Heuristic

provides a "good enough" solution to a problem when an actual solution is impractical or impossible

12
New cards

Decision Problem

a problem with a yes/no answer (e.g., is there a path from A to B?)

13
New cards

Optimization Problem

a problem with the goal of finding the "best" solution among many (e.g., what is the shortest path from A to B?)

14
New cards

Undecidable Problem

a problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer

15
New cards

Sequential Computing

a model in which programs run in order, one command at a time

16
New cards

Parallel Computing

a model in which programs are broken into small pieces, some of which are run simultaneously

17
New cards

Distributed Computing

a model in which programs are run by multiple devices

18
New cards

Speedup

the time used to complete a task sequentially divided by the time to complete a task in parallel