Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
From the following options, expressed in hexadecimal notation, select the answer which is a normalised floating point number: Pick 1 answer
I know the answer is one but I forgot how to work out this question, can anyone assist?
1.80800000
2.ff800000
3.80080000
4.FFF8FFFF
Normalized values are numbers where the exponent part is between 0x01 and 0xFE. Other exponents have special meanings. The first option has an exponent part of 0x01, the second and fourth options have 0xFF and the third option has 0x00.
Related
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 4 years ago.
Improve this question
I learn a deterministic final automat, nondeterministic,regex... And I found that is important to know a difference between ∑ and ∑1 since they both the same if ∑={0,1}, but I will answer that ∑1 is result of concatenation epsilon and 0,and the epsilon and 1.How would you answer that the question is asked by the professor?
Well, sigma is a finite set of input symbols called the alphabet ∑.
∑1 on the other hand is the word w consisting of one letter of the alphabet ∑, hence the 1 in ∑.
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 4 years ago.
Improve this question
I am trying to find an ascii formation to have a unit in a graph in exponent -2 and -3. For example mm^(-2). I found the relevant ascii formation for exponent 2 and 3 but i cannot find how to include the - sympol in the exponent.
Do you have any suggestions?
It depends on the character set you are using. If Unicode then there is 'SUPERSCRIPT MINUS' (U+207B) but not superscript minus two. So, as two characters, mm⁻².
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
Besides the impossibility of representing decimal numbers like 0.1 in a binary base, and, the inaccuracy by design of denormalized floats; is there any other source of inaccuracy when working with double floating-point numbers?
Just one strange example of numerical inaccuracy of floats is as follows:
If one converts 9999999.4999999999 to a float and back to a double, the result is given as 10000000, even though that value is obviously closer to 9999999, and even though 9999999.499999999 correctly rounds to 9999999.
I understand that this is a very specific example, but more detailed (and scientific reasoning!) can be found here:
https://docs.oracle.com/cd/E19957-01/806-3568/ncg_goldberg.html
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
Number of digits that are present in the maximum number that is formed using three digits?
Maximum factorial that is formed by three digits?
This was a question asked on a site.
I am not able to understand is there any thing tricky i am not getting?
i have tried 3 and 720 but it is incorrect
The maximum factorial which can be formed using 3 digits is 999!.
The answer can be easily obtained from wolfram alpha.
Number of digits in 999!.
999!=Answer
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
I try to calculate, based on given parameters, integer overflow.
for example, if I have an integer than is <= 200, but when I insert it to an unsigned int, it will be > 200. What is the actual arithmetic process for that?
Operations on fixed size integers are usually made modulo 2m, where m is the number of bits (nowadays usually 32 or 64).
This means that a multiple of 2m is added or subtracted from the result to keep it in the range for the type, be it unsigned (0, 2m-1) or signed (-2m-1, 2m-1-1).
You might be interested in the Mathematical foundations of computer integers.