Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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
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
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
The main function of a browser is to? The important function is to interpret HTML of a browser.
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
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 is known as?? Root.
List Out the Features of Computer Memory? Features of each type of memory Type Volatile? Write able? Erase Size
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? Mutual-exclusion implementation along with semaphores: Assume that there are n-processes and they share a semaphore, mutex (stan
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
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd