Define range which a normalised mantissa can signify, Computer Engineering

Assignment Help:

Now let's define range which a normalised mantissa can signify. Let's presume that our present representations has normalised mantissa so left most bit can't be zero so it has to be 1. So it's not required to store this first bit and it's being presumed implicitly for number. So a 23-bit mantissa can signify 23 + 1 = 24 bit mantissa in our representation.

So smallest mantissa value can be:

Implicit first bit as 1 followed by 23 zero's which is   

0.1000 0000 0000 0000 0000 0000

Decimal equivalent = 1 × 2-1 = 0.5

Maximum value of mantissa:

Implicit first bit 1 followed by 23 one's which is 

0.1111 1111 1111 1111 1111 1111

Decimal equivalent:

For finding binary correspondent let's add 2-24 to above mantissa as below   

Binary: 0.1111 1111 1111 1111 1111 1111

2297_Define range which a normalised mantissa can signify.png


Related Discussions:- Define range which a normalised mantissa can signify

Best method between linear and matrix addressing modes, Which of the best m...

Which of the best method between linear addressing and matrix addressing modes ? Ans: Best Method: Matrix Addressing is the suitable method, since this configuration on

Show the noframes tag, Q. Show the Noframes Tag? tag can be used for t...

Q. Show the Noframes Tag? tag can be used for those browsers which aren't able to interpret tags. Even though most, if not all, of your visitors would

Convert binary number in two''s compliment form, Convert binary number in t...

Convert binary number in two's compliment form 0100 1000. Converting the binary number into 2's compliment from 0100 1000 is given below: 01001000 => 10111000

How a procedure define in assembly, Q. How a Procedure define in Assembly ?...

Q. How a Procedure define in Assembly ? Procedure is defined within source code by placing a directive of form: PROC A procedure is terminated using: ENDP The

Algorithmic complexity theory, Algorithmic Complexity theory: Moreover...

Algorithmic Complexity theory: Moreover a similar situation occurs in broad to specific ILP systems when the inference rules are deductive thus they specialize. So at some sta

How a shift register can be used as a ring counter, Explain how a shift reg...

Explain how a shift register can be used as a ring counter giving the wave forms at the output of the flipflops. Ans: Shift Register as a Ring Counter: A Ring Counter is a

What is stack and register manipulation, Q. What is Stack and register mani...

Q. What is Stack and register manipulation? Stack and register manipulation: If we create stacks, stack instructions prove to be useful. LOAD IMMEDIATE is a good illustration

How to make a datapool, When producing a datapool, you state the kinds of d...

When producing a datapool, you state the kinds of data (called data types) that the script will send for example, customer names, addresses, and unique order numbers or product nam

What are different adder circuits you studied, Half Adder (for addition of ...

Half Adder (for addition of two bits) Full Adder (for addition of three bits) Carry look ahead adder Carry save adder Carry propagate adder

Explain parsing techniques, Explain any three parsing techniques. Follo...

Explain any three parsing techniques. Following are three parsing techniques: Top-down parsing: This parsing can be viewed as an attempt to get left-most derivations of an

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd