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

Addition of array elements using two processors, Q. Addition of array eleme...

Q. Addition of array elements using two processors? In this example we have to find sum of all elements of an array A of size n. We will divide n elements in 2 groups of roughl

Explain in detail about touch screens, Explain in detail about Touch screen...

Explain in detail about Touch screens For people who can't use a keyboard allowing input; also helps people with learning difficulties since icons are easier to understand

How can i delete a file, The Standard C Library function is removing. (This...

The Standard C Library function is removing. (This is thus one of the few questions in this section for which the answer is not ''It's system-dependent.'') On older, pre-ANSI Unix

Differentiate memory mapped and isolated i/o, Q. Explain how does CPU perf...

Q. Explain how does CPU perform Read and Write operation on peripheral device taking suitable example in case of Asynchronous Technique. Differentiate Memory mapped and Isolated

Pre order given find post order ?, The preorder traversal sequence of a bin...

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?

Explain the odd-even transposition algorithm, Q. Explain the odd-even trans...

Q. Explain the odd-even transposition algorithm? The algorithm needs one 'for loop' beginning from I=1 to N it implies that N times and for every value of I, one 'for loop' of

Example multi-layer ann with sigmoid units, Example Multi-layer ANN with Si...

Example Multi-layer ANN with Sigmoid Units: However we will concern ourselves here that with ANNs containing only one hidden layer and as this makes describing the backpropaga

Instruction set design considerations, Some of the fundamental consideratio...

Some of the fundamental considerations for instruction set design includes selection of:  A set of data-types (For example: integers, long integers, doubles, character strin

What do you mean by u-area or u-block, What do you mean by u-area (user are...

What do you mean by u-area (user area) or u-block? This having the private data that is manipulated only by the Kernel. This is local to the Process, i.e. every process is a

Design a nand-to-and gate network, Use as few gates as possible, design a N...

Use as few gates as possible, design a NAND-to-AND gate network that realize the following Boolean algebra expression. A'BC'D + ABC'D' + A'B'CD' + AB'C'D'

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