AP CSP: Unit 10 - Algorithms

studied byStudied by 3 people
0.0(0)
Get a hint
Hint

Problem

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.

18 Terms

1

Problem

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

New cards
2

Algorithm

a finite set of instructions that accomplish a task

New cards
3

Sequencing

putting steps in an order

New cards
4

Selection

deciding which steps to do next

New cards
5

Iteration

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

New cards
6

Efficiency

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

New cards
7

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

New cards
8

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

New cards
9

Reasonable Time

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

New cards
10

Unreasonable Time

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

New cards
11

Heuristic

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

New cards
12

Decision Problem

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

New cards
13

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?)

New cards
14

Undecidable Problem

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

New cards
15

Sequential Computing

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

New cards
16

Parallel Computing

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

New cards
17

Distributed Computing

a model in which programs are run by multiple devices

New cards
18

Speedup

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

New cards

Explore top notes

note Note
studied byStudied by 44 people
... ago
5.0(2)
note Note
studied byStudied by 8 people
... ago
5.0(1)
note Note
studied byStudied by 46 people
... ago
5.0(2)
note Note
studied byStudied by 16 people
... ago
5.0(1)
note Note
studied byStudied by 168 people
... ago
5.0(1)
note Note
studied byStudied by 18 people
... ago
5.0(1)
note Note
studied byStudied by 3 people
... ago
5.0(1)
note Note
studied byStudied by 4 people
... ago
5.0(1)

Explore top flashcards

flashcards Flashcard (77)
studied byStudied by 1 person
... ago
5.0(1)
flashcards Flashcard (100)
studied byStudied by 83 people
... ago
5.0(1)
flashcards Flashcard (20)
studied byStudied by 20 people
... ago
5.0(1)
flashcards Flashcard (32)
studied byStudied by 5 people
... ago
5.0(1)
flashcards Flashcard (27)
studied byStudied by 16 people
... ago
5.0(1)
flashcards Flashcard (93)
studied byStudied by 2 people
... ago
5.0(1)
flashcards Flashcard (24)
studied byStudied by 3 people
... ago
5.0(1)
flashcards Flashcard (170)
studied byStudied by 70 people
... ago
5.0(2)
robot