Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
10 Cards in this Set
- Front
- Back
|
Outline an algorithm to multiply 2 binary floating point numbers
|
Multiply the coefficients and add the exponents, then normalize the results.
|
|
|
Define truncation
|
Clipping a value to n places regardless of its neighbour i.e. no rounding
|
|
|
Outline an algorithm for floating point addition
|
Align coefficients(choose smallest value and shift it to the right to make both exponents the same) -> Add coefficients
|
|
|
State the formula for comparing floating point values A and B
|
B - E < A < B + E
|
|
|
What is the significand?
|
The coefficient of a floating point number.
|
|
|
What are the range of values represented by 32bit floating point number(IEEE)
|
+/- 1.F * 2^(e -127) or (-/+) 10^38 to (+/-) 10^-38.
|
|
|
What do the bits represent in the IEEE 32 bit format
|
1bit = sign | 8 bits exponent | 23 bits significand.
|
|
|
What do the bits represent in the IEEE 64 bit format
|
1bit = sign | 11 bits exponent | 52 bits significand.
Outline an algorithm to convert a decimal into a floating point number and vice versa, TODO |
|
|
Outline an algorithm to add 2 floating point numbers
|
TODO
|
|
|
What are the types of numbers that that the IEE format can encode and what are their bit patterns?
|
zero
Normalised Denormalised numbers, Infinity NaNs |
