vocab

Question 1

arithmetic sequence

Answer 1

a sequence is equal to the number before plus a constant

Question 2

Geometric sequence

Answer 2

a sequence equal to the number before times the a constant

Question 3

(spped of algerathem )

Answer 3

df

Question 4

best case
worst case - we use worst case to guarantee performance
average case

Answer 4

sdf

Question 5

asymptotic notations

Answer 5

1. Big O
2. Big omega
3. theta

Question 6

logarithm

Answer 6

A logarithm answers the question “How many of one number do we multiply to get another number?”

Example How many 2s need to be multiplied to get 8?
Answer: 2 × 2 × 2 = 8, so we had to multiply 3 of the 2s to get 8

We say the logarithm of 8 with base 2 is 3

In fact these two things are the same:

Question 7

algorithm

Answer 7

algorithm is any well-defined computational procedure that takes
some value, or set of values, as input and produces some value, or set of values, as
output.

Question 8

Data structures

Answer 8

data structure is a way to store

and organize data in order to facilitate access and modifications

Question 9

NP-complete

Answer 9

problems for which no efficient solution is known

Question 10

Parallelism

Answer 10

“multithreaded” algorithms,

Question 11

input size

Answer 11

number of items in the inpu

Question 12

running time

Answer 12

running time of an algorithm on a particular input is the number of primitive
operations or “steps” executed

Question 13

Analyzing algorithms

Answer 13

combo of running time and input size

Question 14

Order of growth or order of growth,

Answer 14

constant factors are less significant than the rate of growth
in determining computational efficiency for large inputs

Question 15

asymptotic efficiency of algorithms

Answer 15

input sizes large enough to make only the order of growth of

the running time relevant

Question 16

Divide-and-Conquer- recursive

case

Answer 16

When the subproblems are large enough to solve recursively

Question 17

Divide-and-Conquer- base

case

Answer 17

subproblems become small enough that we no longer recurse,
we say that the recursion “bottoms out” and that we have gotten down to the base
case.

Question 18

Θ

Answer 18

Big Theta - after point x f(n) > g(n) and f(n)

Question 19

Ω

Answer 19

Big Omega - after point x f(n) > g(n) or f(n) = Ω(g(n))

Question 20

O

Answer 20

Big O Big Theta - after point f(x) is

Question 21

asymptotically tight bound

Answer 21

xxxx

Question 22

asymptotically nonnegative

Answer 22

xxx

Question 23

asymptotically positive

Answer 23

xxxx