The largest positive number that can be represented with n bits in 2s complement representation is 2N−1 − 1.
with 12 bits the largest number would be 2^11 - 1 = 2047
so 2047 in hexadecimal 7FF
The answer is 0x7FF
ANSWER :
Largest 12 bit 2’s
= 111111111111 (binary)
= 2^11 + 2^10 + 2^9 + 2^8 + 2^7 + 2^6 + 2^5 + 2^4 + 2^3 + 2^2 + 2^1 + 1
= 4095
4095 in hexadecimal system :
4095/16 = Q 255 R 15 , take 15 I.e F to unit place.
255/16 = Q15 R 15 , take 15 I.e F to 2nd place (to the left of first place)
15/16 + Q0 R 15 , take 15 I.e. F to 3rd place (to the left of 2nd place)
Hence, 4095 (decimal) is F F F in hexadecimal.
So, the ANSWER is : OxFFF
What is the largest positive number that can be represented with 12 bits in 2's complement...
2.) What is the largest positive number in decimal, that can be represented using 8 bits? Each groups of binary numbers can be represented more compactly in base-16 numbering, which is called hexadecimal. The hexadecimal digits are 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F. 3.) What range of positive decimal numbers can one hexadecimal digit represent? Colors on a computer monitor are represented by 6 hexadecimal numbers, the first pair to the left specifies the amount of red to display, the middle pair of numbers specify...
What is the most positve and most negative number that can be represented in 2's complement system of 6 bits? Express the answer in decimal and binary.
please include only the digits of the appropriate number
system. In particular, do not precede the answers with ‘0x’ or ‘0b’
or follow your answers with base indicators, like subscript 2 or
10.
1. A processor uses 24 bits for its memory addressing. How many possible distinct locations (in decimal) can the computer address? The computer memory address locations are numbered from 0 to the maximum. If a memory locations' address is (7243)10, how is this address represented in binary...
Compute the sign extension into 16-bits of +20 and -123 represented in 2’s complement in 8-bits. Prove that when an 8-bit representation is sign-extended into 16 bits by replicating the sign bit 8 times in the more significant end, you get the same value both for a negative and non-negative X using X=- xn-12n-1 + x n-22n-2+…+ x222 + x121+ x0 20.
2.20 Encode the following negative numbers using 2's complement representation in the binary and hexadecimal number systems using 8 and 16 bits. a. -12 b. -68 c.-128
5. Answer the followings a) Lets computer stored numbers in 8 bits in 2's complement format, what is the largest and smallest number that can be stored? b) In (a) If we add 1 to the largest number what would happen? if we subtract 1 from smallest number what would happen? c) Why exponent is stored as biased exponent in floating point representation? d) In EFLAG register, some bits have given fixed value 0/1.what is rationale behind it?
What is the largest number that can be represented using eight bits? Select one: a. 255 O b. 256 c. 128 O d. 127
The largest unsigned decimal number that can be represented in binary using six bits is
Lengthen the two's complement number (both shown in hex) E3 and 3E to 16 bits. (NOTE: The values represented in each case should remain the same length after lengthening.) Your 16 bit answer in hex (for E3 in two's complement): Your 16 bit answer in hex (for 3E in two's complement): Shorten (if possible) the two's complement numbers (both shown in hex) E3 and 3E to the minimum number of bits needed. (Note 1: The values represented in each case...
Let x be a signed integer represented using the 12-bit 2's complement scheme. What is the maximum possible value that x can represent? Enter your answer in decimal (base 10)