What is the smallest integer n (stored as a floating point value) such that n + 1.0 - n will produce 0.0 for: a) Single-precisio
n IEEE 754 floating point?
1 answer:
Answer: The FP-s are stored as sign (1.)111111111111 - number of bits.
Also 24 bits resolution there can be 23 zeros
Explanation:
The –1·2²⁴ might be stored as -1 · 1.00000000000000000000000(1 ←the 2⁰), it depends on how the FFP “engine” manages this, it may also be code specific a n+1–n does return 1 but 1–n+n does not. you should carry out a test for a specific compiler/computer
This is what javascript does with double (k+=1; n-=1) e.g
the (k+=2; n-=2) should be used to pass ±0x20000000000000
You might be interested in
Answer:
ArrayList a contains [2, 3, 3, 3, 4, 5, 3, 2, 1]
Explanation:
Given
The removeValue method
Required
The content of ArrayList a, after the method is called
From the question, we understand that arraylist a is:
The function fails when the value to be removed appear consecutively in the list.
4 appears in index 5 and 6 of the list. Only one of the 4's will be removed
So, the updated list will be: [2, 3, 3, 3, 4, 5, 3, 2, 1]