Big Idea 3

Question 1

Algorithm

Answer 1

set of steps to solve a problem (recipe). can be used over an over again

Question 2

Pseudocode

Answer 2

used to map out a program’s structure before actually writing in the programming language

Question 3

Flowchart symbols

Answer 3

Oval - start/end
Arrow - relationship between shapes
Parallelogram - input/output
Rectangle - result
Diamond - decision/conditional

Question 4

Clarity

Answer 4

how easy program is to understand

Question 5

Readability

Answer 5

help programers understand the program

Question 6

How many algorithms can solve a problem

Answer 6

many algorithms can be used to solve a problem. different algorithms may have different efficiencies

Question 7

Variable

Answer 7

placeholders for values a program needs to use. a good name is necessary. are data abstractions because we don’t need to knowhow the values are stored.

Question 8

Value

Answer 8

Number
“String”

Question 9

String

Answer 9

text fields donated with quotation marks. CANNOT be used in calculations

Question 10

Concatenating Strings

Answer 10

putting strings together

Question 11

Substring

Answer 11

a section of a string. each character given an index number if need to be references (starts at 1). Spaces HAVE an index value.

Question 12

Integer

Answer 12

whole number

Question 13

Fractional Numbers

Answer 13

number with a decimal point (even if .0)

Question 14

Math Symbols

Answer 14

+ add
- minus
/ divide
* multiple
MOD # (remainder after dividing)

Question 15

how to assign a value to a variable

Answer 15

= or <–

Question 16

Boolean Values

Answer 16

True or False (equal to, not equal to, greater than, less than, greater than or equal to, less than or equal to)

Question 17

Compound Conditional Statements

Answer 17

boolean expressions using AND, OR, NOT

AND - both must be true to evaluate to true
OR - only 1 must be true to evaluate to true
NOT - evaluates to true if condition is false

Question 18

Types of Statements

Answer 18

Sequential - statements executed in order one at a time
Selection - using if statements, therefore, not all the code is run if an if statement evaluates to false (ELSE IF)
Iterative - repetitive statements or loops (repeat N times, repeat until condition is met)

Question 19

Common Algorithms

Answer 19

Maximum: compare numbers, store larger number as max
Minimum: compare numbers, store smaller number as min

Sum and Average: set counter and sum = 0, get current number, add it to sum, add 1 to counter, repeat until all numbers are counted, divide sum by counter to get average, display sum and average

Find if Number is Divisible by another: # MOD # = 0 is true

Largest/Smallest Number in List: repeat until the length of the list = index, if the number is greater/less than the current greatest/smallest, that value at that index number is replaced in the largest/smallest

Sum and Average of List: for each element in list, sum = number + sum, divide sum by list length

Question 20

List

Answer 20

collection of items. allow many values in one variable. use [ ].

To reference an item, refer to its index (it is numbered starting at 1). listName[1];

Question 21

Where does the index start at

Answer 21

1

Question 22

Manipulating Lists

Answer 22

INSERT - causes elements to the right of the index position to shift right 1 position. (INSERT(listName, i, value)

APPEND - adds item to the end of the list (APPEND(listName, value)

REMOVE - removes the element at the index position and shifts the rest (REMOVE(listName, i)

LENGTH - number of elements in a list (LENGTH(listName)

Question 23

Checking Items in a List

Answer 23

FOR EACH - repeats the code for each element in the list (traversal)

Question 24

Searching

Answer 24

finding the needed element from everything in the dataset or determining that it is not there.

Types of Searches:

Linear - sequential searches. check each value one by one and determines if the value is equal to the value you’re searching for

Binary - only works for SORTED numbered lists. more efficient. looks at the number in the middle and compares it to number you’re searching for, goes to left/right side of list based on if its higher or lower, keeps splitting it in half until the number is found

Question 25

Procedures

Answer 25

aka functions. sections of code that will only be executed when they are called by the program. after a procedure is executed, it goes back to where it was left off an continues.

Question 26

Parameter

Answer 26

makes procedures more flexible. when you call the program, you can send specific values to the program known as arguments.

Question 27

Return

Answer 27

a feature in some procedures, which returns an output

ex.
DISPLAY - prints the value
INPUT - accepts data from user

Question 28

Libraries

Answer 28

when writing code, you can import already made code to reuse in your program. looking at the API can help determine what each part does

Question 29

API

Answer 29

Application Programming Interface - documentation which provides how to use the parts of the program such as what values can be plugged into parameters

Question 30

RANDOM (a, b)

Answer 30

start and end value are defined and a random number is chosen between them (INCLUDING the start and end values)

Question 31

Simulations

Answer 31

designed to represent and mirror the real world for testing. an example of abstraction as details are removed to evaluate the impact without causing real-world impact. helps evaluate hypothesis without risk. saves time and money.

Question 32

Problem

Answer 32

task that can or cannot be solved with an algorithm

Question 33

Instance of a problem

Answer 33

specific example

Question 34

Decision Problem

Answer 34

has a yes or no answr

Question 35

Optimization Problem

Answer 35

one that should find the best solution for the problem

Question 36

Efficiency of an Algorithm

Answer 36

how long it takes and how much memory will be needed

Question 37

Decidable Problem

Answer 37

one where an algorithm can be written resulting in correct output

Question 38

Undecidable problem

Answer 38

doesn’t have an algorithm that can give an answer for all cases. a heuristic may have to be used

Question 39

Heuristic

Answer 39

approach that may not be the best but it is close enough to use as a solution

Question 40

Iteration

Answer 40

when the program requires specific code to be run more than once

Question 41

Procedural Abstraction

Answer 41

using procedures (functions) to reuse code

Question 42

Modularity

Answer 42

The separation of a program into independent modules that are each responsible for one aspect of the program’s functionality