IsaacShoebottom/Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

2024-09-09 09:34:04

Browse Source
This commit is contained in:
Isaac Shoebottom 2024-09-09 09:34:04 -03:00
parent 890ea418be
commit ebeecbb11f
1 changed files with 14 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
UNB/Year 5/Semester 1/CS3113/In class notes.md
View File

@ -21,4 +21,17 @@ So in binary 110101, as the order is in reverse of the decimals
| 0.6 x 2 = 1.2 | 1 | | 0.6 x 2 = 1.2 | 1 |
| 0.2 x 2 = 0.4 | 0 | | 0.2 x 2 = 0.4 | 0 |
And so on.. so the fraction would be .10110, with 0110 repeating infinitely And so on.. so the fraction would be .10110, with 0110 repeating infinitely
So the final number would be 110101.10110... So the final number would be 110101.10110...
**Normalization** is the process is the process of adjusting a number so only 1 non zero digit on the left side of a number, i.e. the number is in scientific notation
## Floating point number types
| Precision | Sign | Exponent | Mantissa |
| ----------- | ---- | -------- | -------- |
| single | 1 | 8 | 23 |
| double | 1 | 11 | 52 |
| long double | 1 | 15 | 64 |
Truncation types
**Chopping**: Omit the numbers that we don't want, looking to the first bit that we want to erase
**Rounding**: We should take care about the first digit that we want to omit and adjust the 52nd bit