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

8085 programs, what is the theory used to check whether a number is negativ...

what is the theory used to check whether a number is negative or positive?

Differentiate between linear and matrix addressing modes, Differentiate bet...

Differentiate between linear addressing and matrix addressing modes with examples. Ans: Linear Addressing: Addressing is the procedure of selecting one of the cells in a

COA, During instruction execution, there are other parts of the CPU that ca...

During instruction execution, there are other parts of the CPU that can determine when a physical register might be freed. Briefly describe where else we can put freeing logic and

Define the message queues, The message queue provides the information about...

The message queue provides the information about sizes of queues under utilization of various processors. It points to size of every processor incoming message queue that would be

Isoquants, what are the types of isoquants

what are the types of isoquants

Explain the methods of implementing interacting processes, Explain any two ...

Explain any two methods of implementing interacting processes. Two methods of implementing interacting process are given below: (i) Shared memory solution: In this scheme

Explain about floating point representation, Q. Explain about Floating Poin...

Q. Explain about Floating Point Representation? Floating-point number representation includes two parts. The first part of number is a signed fixed-point number which is called

Jewel polishing, Byteland county is very famous for luminous jewels. Lumino...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

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