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

Write truth table of combinational circuit, A combinational circuit has 3 i...

A combinational circuit has 3 inputs A, B, C and output F.  F is true for following input combinations A is False, B is True A is False, C is True A, B, C are

Labels in the sub trees, A sorting method which uses the binary tree concep...

A sorting method which uses the binary tree concept such that label of any node is larger than all  the labels in the sub trees, is called A Sorting method which uses the binar

What is the main function of a browser, The main function of a browser is t...

The main function of a browser is to? The important function is to interpret HTML of a browser.

Explain icw, Question 1 What are the drivers behind the convergence betwee...

Question 1 What are the drivers behind the convergence between voice and data networks? Explain them briefly Question 2 Explain the need and functioning of Private ST Netw

Explain input - output techniques, Q. Explain the Hard Disk Controller & F...

Q. Explain the Hard Disk Controller & Floppy Disk Controller with necessary diagrams. Q. Explain Input/Output Techniques (Data Transfer Techniques).

Node at the highest level in the structure, Node at the highest level in th...

Node at the highest level in the structure is known as?? Root.

List out the features of computer memory, List Out the Features of Computer...

List Out the Features of Computer Memory? Features of each type of memory   Type Volatile? Write able? Erase Size

Write a pseudo code to find sum of two functions, Q. Write a pseudo code to...

Q. Write a pseudo code to find sum of two functions? Let's write a pseudo code to find sum of two functions f(A) + f(B). In first algorithm we will not use locking. Process

How semaphores implement mutual exclusion, How semaphores implement mutual ...

How semaphores implement mutual exclusion? Mutual-exclusion implementation along with semaphores: Assume that there are n-processes and they share a semaphore, mutex (stan

Simplified boolean expression, Simplified the Boolean Algebra (x + y)(x + z...

Simplified the Boolean Algebra (x + y)(x + z) simplifies to ? Ans. x + yz as simplified the Boolean Algebra expression. [(x + y) (x + z)] = xx + xz + xy + yz = x + xz + xy + y

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