Tagged Questions
1
vote
1answer
61 views
Euclidean Division to avoid need for floating point arithmetic
In simple terms (that Google has been unable to provide the answer), is there an approach to dividing a whole integer by a quotient & remainder?
As a specific example,
...
0
votes
0answers
95 views
Square root using simple arithmetic shift, inversion etc
Suppose we have a function which is sampled by a sampling time 10ms. This function comes in to the computer, then this computer should calculate square root (for every sampling time) from that ...
2
votes
0answers
113 views
1/3+2/3 in double precision
When I add 1/3 and 2/3 in double precision, I ended up with $1.\boxed{111\ldots1}1\times2^{-1}$, where the boxed part is the 52-bit mantissa. By the rounding to even rule, I should round it up, right? ...
0
votes
2answers
313 views
Do calculators have floating point error?
As a programmer, we have been told about floating points errors on computer. Do Calculators have floating point error too?
Example.
...
1
vote
2answers
107 views
Using base-2 numbers: $(1010001)_{2}/(11)_{2}=?$
I wanna solve this simple equation using base-2 number system.
$(1010001)_{2}/(11)_{2}=?$
I can't remember how to do that, normally I would start with $101/11$ but what should I do this base-2 ...
0
votes
2answers
219 views
bitwise operations
so my question is what is the order of operations for bitwise operators
<< & |
and also to see if my logic is right with the problem below
(x03 << x08)+ x00 = 300
...
