0
Add your answer:
Earn +20 pts
What is the answer to 2s-12 plus 2s equals 4s-12?
2s - 12 + 2s = 4s - 124s - 12 = 4s - 124s = 4ss = s==========this is an identity and any number can be s
2r plus 2s equals 50 and 2r minus s equals 17?
2r + 2s = 50 2r - s = 17 therefore 4r - 2s = 34 Add so that you can eliminate one of the variables: 2r + 2s = 50 4r - 2s = 34 ---------------- 6r + 0s = 84 Solve for r: 6r = 84 r = 14 Substitute r into one of the original equations: 2(14) + 2s = 50 28 + 2s = 50 2s = 22 s = 11 Doublecheck with the other original equation: 2(14) - 11 = 28 - 11 = 17
If p equals 2s plus 5 what is s in terms of p?
If p = 2s + 5, then s = (p-5)/2 or 1/2 (p-5) --- p = 2s +5 p-5 = 2s (p-5)/2 = s
The difference between two numbers is 11 Twice the smaller number plus three times the larger number is 123?
L = S + 11; 2S + 3(S + 11) = 123, ie 2S + 3S + 33 = 123ie 5S = 90 ie S = 18 and L = 29
18r 4s 5t 6 divided by -3r 2s t 3?
-6r 2s 5t 2
What is the binary complement 8 bit representation for negative 19?
8-bit 2s complement representation of -19 is 11101101 For 1s complement invert all the bits. For 2s complement add 1 to the 1s complement: With 8-bits: 19 � 0001 0011 1s � 1110 1100 2s � 1110 1100 + 1 = 1110 1101
Subtract the hexadecimal number 1234 from DA57 using twos complement addition method?
(1234)hex=(0001 0010 0011 0100)2 (DA57)hex=(1101 1010 0101 0111)2 Taking, (1234)hex=(0001 0010 0011 0100)2 =(1110 1101 1100 1011) -1s complement =(1110 1101 1100 1100) -2s complement Now ,add 2s complement of (1234)hex with (DA57)hex, we get 1110 1101 1100 1100 + 1101 1010 0101 0111 1 1100 1000 0010 0011 There is a Carry bit Since,carry is generated.so,no is negative Then take 2s complement of above no.Thus ,we get 0011 0111 1101 1101=(37DD)hex (1234)hex -(DA57)hex =37DD)hex
Do binary numbers consist of 1 and 2s?
Yes
What is binary equivalent of -15 using 2's complement?
-15 is 11111111 and 2s com is 1111 0001
Why 2's complement binary subtraction is preffered over 1's complement binary subtraction?
1
Computers process binary numbers which are composed of?
Binary numbers, with or without a computer are a series of 1's and 0's.
How you do find the binary code of -19?
One way is using the Twos (2s) complement; that is you find the binary representation of the positive number of -19, flip all the bits (0s to 1s and 1s to 0s), and finally add 1 to it.The positive bit of -19 is simply 19. It has a binary code of 0001 0011 (8 bits are required for this particular method). Flipping the bits, we get 1110 1100. Adding 1 (or 0000 0001) to our last answer, we get 1110 1101 which would be the binary representation of -19.
What is the integer equivalent represented by 2's complement of the binary number 10001011?
To get the 2s complement, change all 1 bits to 0s and all 0 bits to 1s, and add 1 to the result. So the 2s complement of the 8-bit binary number 10001011 is the binary integer 01110101. If you want that in decimal, then remember that each place value column is twice the value of the place value column to its right, and the rightmost place value column for an integer is 1. Thus 01110101 in decimal is 64 + 32 + 16 + 4 + 1 = 117 (And 10001011 as a signed 8-bit binary integer represents the decimal integer -117.)
The 2's compliment of the number 1000 is?
To get the 2s complement, find the 1s complement (by inverting the bits) and add 1. Assuming that number is [4-bit] binary it would be 1000. If it is preceded by 0s, as in, for example, 0000 1000, then it would be 1111 1000.
What is the range of numbers that can be encoded in 4 bits using 2s complement notation?
Using 4 bits the signed range of numbers is -8 to 7. When working with signed numbers one bit is the sign bit, thus with 4 bits this leaves 3 bits for the value. With 3 bits there are 8 possible values, which when using 2s complement have ranges: for non-negative numbers these are 0 to 7; for negative numbers these are -1 to -8. Thus the range for signed 4 bit numbers is -8 to 7.
What is the 2's complement value of -85?
87
What is the 2's complement value of 98?
To find the 2s complement invert the bits and add 1: 98 = 1100010 = ...0000 0110 0010 (written in complete nybbles with leading 0 bits) → 2's complement: ...1111 1001 1101 + 1 = ...1111 1001 1110 Every bit in front of the first bit is a 1 (the exact number will depend upon the number of bytes used to store the number).
