Approximations Flashcards

(15 cards)

1
Q

what is a flop?

A

Floating Point OPERATION

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a flop per second?

A

a unit of measurement used to approximate the time it takes for an operation to be executed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

how do computers display n on integers?

A

they have to display floating points using a string of binary digits.

  • the first binary digit stores the sign of the number: 0 if positive, 1 if negative
  • the proceeding string of binary digits stores the value of the exponent; 2^(N-M), where N represents the number represented by the string of digits, and M=2^(N-1)-1
  • the last string of digits stores the value of the mantissa(multiplying factor)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

how do you find the actual floating point value?

A

multiply the exponent and the mantissa, using the sign from the first digit to determine the sign of the number

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What do O(n^k) and o(n^k) represent?

A

they represent the Big O and Little O of a certain function - the value of k depending on whether n approaches zero or infinity.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What does k present for the Big O function when n goes to infinity?

A

for the Big O notation, limit as n goes to infinity of F(n)/n^k = constant, so k represents the power of n that dominates the function

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What does k present for the Little O function when n goes to infinity?

A

limit as n goes to infinity of f(n)/n^k = 0

so k presents the smaller integer greater than the power of n that domminates the function

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What does k present for the Big O function when n goes to zero?

A

k presents the power of n that least dominates the function

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What does k present for the Little O function when n goes to zero?

A

k represents the greatest integer smaller than the power of n that least dominates the function

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

suppose that x, is the computed approximation of Xo, what is the absolute error of x?

A

would be given by AE(X1)=abs(X1-Xo)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

whats the formula for the relative error of x1?

A

RE(x1)=abs(x1-xo)/abs(xo)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

what gives an estimate for the relative error?

A

epsilon * abs(x) , where epsilon is the relative precision on a computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

what is a rounding error?

A

refers to the error associated with rounding a value to n number of sig figs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

what is confidence?

A

the no. of sig figs we can accuately say that the value of something is

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

what can happen if we do arithmetic involving a large number and a comparably smaller number, and how can we alleviate this?

A

will cause catastrophic cancellation, can rearrange the expression with the catatropshic cncellation into a mathematically equivalent but numerically preferable expression

How well did you know this?
1
Not at all
2
3
4
5
Perfectly