big idea 3 csp

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

https://quizlet.com/570804284/ap-csp-big-idea-3-algorithms-and-programming-flash-cards/?i=3cf6l8&x=1jqt

1 / 41

42 Terms

1

https://quizlet.com/570804284/ap-csp-big-idea-3-algorithms-and-programming-flash-cards/?i=3cf6l8&x=1jqt

New cards
2

Algorithm

Set of steps to solve a problem or complete a task.

New cards
3

API (Application Program Interface)

Contains specifications for how the procedures in a library behave and can be used.

New cards
4

Argument

The actual input expression supplied to a function or procedure in the call statement.

New cards
5

Arithmetic Operators

+, -, *, /, %

New cards
6

Assignment Statement

To assign a value to a variable

New cards
7

Binary Search

Considered a "divide and conquer" algorithm because it divides the dataset into two equal parts. Feedback about whether the value in question is higher or lower than the midpoint of the list determines which half to discard and which half to continue searching. The dividing and searching steps are repeated until the value is found or determined to not be in the list.

New cards
8

Boolean Values

Can only represent the values true or false.

New cards
9

Clarity

How easy it is to understand.

New cards
10

Concatenation

Attaching two things side-by-side, frequently strings.

New cards
11

Condition

Certain requirements that need to be met in order for selection statements to run.

New cards
12

Data Abstraction

Simplifies a set of data by representing it in some general way. You can then work with that representation instead of each piece of data itself.

New cards
13

Decidable Problem

One where an algorithm can be written that results in a correct "yes" or "no" answer for all inputs.

New cards
14

Decision Problem

A problem that has a yes or no answer

New cards
15

Efficiency

The efficiency of algorithms deals with the resources needed to run it in terms of how long it will take and how much memory will be needed. This becomes especially important with extremely large datasets, and efficiency is usually stated in terms of the size of the input. While the time will vary based on the computer used, general rules are used to determine the efficiency of these algorithms.

New cards
16

Element

An individual value in a list.

New cards
17

Expression

A statement that returns only one value.

New cards
18

Heuristic

Some problems can't be solved in a reasonable amount of time. In this case, computers turn to an approximate solution.

New cards
19

Iterative

Also called loops, and they repeat themselves over and over until the condition for stopping is met.

New cards
20

Library

Contains already-developed procedures that you can use in creating your own programs.

New cards
21

Linear Search

Also called a sequential search algorithm, and it checks each value of a list in order until the result is found.

New cards
22

Lists

A collection of items such as integers and strings.

New cards
23

Logical Operators

Known as NOT, AND and OR. These can be used to combine multiple conditions

New cards
24

Modularity

When you divide a computer program into separate sub-programs

New cards
25

Modulus

Modulus math uses division, but only provides the remainder as the answer, not the quotient.

New cards
26

Optimization Problem

Asks what the best solution is to the task at hand.

New cards
27

Parameter

The input variables of a procedure.

New cards
28

Procedural Abstraction

The details of how a procedure works are abstracted away. You only need to know the name of the procedure, the number and type of parameters, and the output to expect.

New cards
29

Procedure

A group of programming instructions. They're also known as methods or functions, depending on the programming language. You can use a procedure to use the same set of instructions, again and again, without having to rewrite it into your code.

New cards
30

Pseudocode

A simplified programming language.

New cards
31

Readability

To help programmers understand a program by writing clear and understandable names.

New cards
32

Relational Operators

Used with Boolean values to test the relationship between two values. ==, !=, >, <, >=, <=
New cards
33

RETURN Statement

  1. To end a function before the end of the procedure is reached.

New cards
34
  1. To send a value back to the calling program.

New cards
35

Selection Statement

Process primarily takes the form of conditional statements known as if statements.

New cards
36

Sequential Statement

Consists of steps in your algorithm that are implemented in the order they're written in. Once you execute one statement, you go on to the next one.

New cards
37

Simulation

Designed to represent and mirror the real world for testing.

New cards
38

String

Text fields that are just a series of characters and are denoted with quotation marks around the text field.

New cards
39

Substring

Section of strings.

New cards
40

Traverse

Go through, a list

New cards
41

Undecidable Problem

Does not have an algorithm that can give a correct "yes" or "no" for all cases of the problem. An algorithm may work for some cases, but not all.

New cards
42

Variable

Placeholders for values a program needs to use.

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