0
100000000000001
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
The twos complement of 11001101 is?
00110011 is the 2's complement for this unsigned number and 10110011 if this is a signed number
Why do you get an even number when you add two even numbers?
An even number is always some quantity of 'twos' (2's), and any quantity of twos is an even number. The first even number is a quantity of twos, and the second even number is another quantity of twos. When you add the first quantity of twos to the second quantity of twos, you get a new quantity of twos. Since the new quantity of twos is a quantity of twos, it's an even number.
What is is the mixed number for three twos?
The answer to three twos is an integer and not a mixed number.
10 Why is twos complement usually used to represent integers?
The advantage of the two's complement method is that the procedure for adding or subtracting numbers is the same, whether the numbers are positive or negative. This makes the hardware for managing these numbers simpler.
What is the difference between the twos complement representation of a number and the twos complement of a number?
Let's consider any number, for example a byte of data represented as eight bits. The values that this byte can have are 00000000 through 11111111. The easiest way to find the one's complement is to change the zeros to one and the ones to zeros. The limits shown above can be represented as 00 through FF in hexadecimal. Let's consider a number AF which is within this boundary. The easiest way to find the one's complement when numbers are represented in hexadecimal form is to subtract the number from (in this case) FF. You will have more F's depending on the length of the number you want to find the one's complement for. If the number consists of three hex digits then you subtract from FFF, if four then from FFFF and so on. Thus with our example of AF, its one's complement would be FF AF --- 50 --- If you add 1 to this result you will get the two's complement of the number AF. Hence the two's complement of AF is (50 + 1) = 51 in hex. Observe that the process of finding one's complement or two's complement of a number are reversible and the original number is obtained. Thus the one's complement of the one's complement of a number gives the original number. The two's complement of the two's complement of a number gives the original number. Lets consider the hex number FF. Its one's complement is 00 and the two's complement is 01. So far we have talked about two's complement of a number (and in the process the one's complement as well). It is not possible to explain two's complement representation without understanding hardware implementation on a computing device, namely, a computer. Let's consider a byte machine where you can operate only on single bytes. Thus you can add two bytes, subtract a byte from another and so on. If two's complement representation of numbers is not implemented on a machine, then the byte can hold values hex 00 through hex FF which would be 0 through 255 in decimal. If 1 is added to a byte containing FF on this machine, the contents of the byte will change to 0 and the overflow bit in the computer will be set to TRUE. If however, two's complement representation of numbers is implemented on a machine the MSB (most significant bit) in the byte is the sign bit. If it is set then the number is negative and if it is not set then the number is positive. Since one bit of the 8 bits in our byte machine is taken up to represent the sign, only the remaining 7 bits can hold the magnitude of the number. The range of positive number in such a machine is hex 00 through hex 7F which is 0 through 127. If you add 1 to 7F then the contents of the byte would be hex 80. Notice that this is a negative number because the MSB is set. But how negative is this number. Since the machine implements two's complement representation of number on this machine, subtract (hex 80) from hex FF and add 1 to get hex 80 which equals 128. So the byte machine which implements two's complement can represent values from -128 through +127. In general if a machine implements 16, 32, or 64 bit architecture, the numbers that they can hold if they implement two's complement are between -(2*n) through and including +(2*n - 1) where n is 16, 32, or 64. I hope you have a better understanding of the difference between two's complement of a number and its representation (meaning implementation) on a computer.
The twos complement of 11001101 is?
00110011 is the 2's complement for this unsigned number and 10110011 if this is a signed number
How do you write a program to determine whether a number is odd or even counter?
For positive integers, if the least significant bit is set then the number is odd, otherwise it is even. For negative integers in twos-complement notation, if the least significant bit is set then the number is odd, otherwise it is even. Twos-complement is the normal notation, allowing a range of -128 to +127 in an 8-bit byte. For negative integers in ones-complement notation, if the least significant bit is set then the number is even, otherwise it is odd. Ones-complement is less common, allowing a range of -127 to +127 in an 8-bit byte, where 11111111 is the otherwise non-existent value -0 (zero is neither positive nor negative). Ones-complement allows you to change the sign of a value simply by inverting all the bits. Twos-complement is the same as ones-complement but we also add one. Thus the twos complement of 0 is 0 because 11111111 + 1 is 0 (the overflowing bit is ignored). 11111111 then becomes -1 rather than the non-existent -0.
Why do you get an even number when you add two even numbers?
An even number is always some quantity of 'twos' (2's), and any quantity of twos is an even number. The first even number is a quantity of twos, and the second even number is another quantity of twos. When you add the first quantity of twos to the second quantity of twos, you get a new quantity of twos. Since the new quantity of twos is a quantity of twos, it's an even number.
How do you programme Twos complement in binary in c?
int complement (int n) { return -n; } or int complement (int n) { return ~n+1; } both does the same thing.
What is is the mixed number for three twos?
The answer to three twos is an integer and not a mixed number.
How do you find twos compliment of 00h in 8085 program?
You find the two's complement of 00H the same way you find it for any other number. You complement the bits and then you add 1. In the case of 00H, this results in 00H. That is no surprise, because -0 is the same as +0, and two's complement representation was chosen to do just that, as well as to make the physical addition of signed and unsigned numbers to be the same.
10 Why is twos complement usually used to represent integers?
The advantage of the two's complement method is that the procedure for adding or subtracting numbers is the same, whether the numbers are positive or negative. This makes the hardware for managing these numbers simpler.
Signed binary subtraction 000000111001-111010000101 equals 000110101110 right?
Wrong. You don't say whether you are using ones-complement notation or twos-complement notation, but in either case you'd be wrong. Your answer of 000110101110 is 430 decimal, but the correct answer is 435 or 436 depending on which notation you use. Ones-complement notation: 000000111001 - 111010000101 = 000110110011 Decimal equivalent: 57 - (-378) = 57 + 378 = 435 Twos-complement notation: 000000111001 - 111010000101 = 000110110100 Decimal equivalent: 57 - (-379) = 57 + 379 = 436 Note that in ones-complement, converting the sign of any value simply inverts all the bits. So if we invert 111010000101 we get 000101111010 which is 378, thus the original signed value was -378. In twos complement we invert all the bits (as per ones-complement) and add 1, so 000101111010 + 1 is 000101111011 is 379, thus the original signed value was -379. QED.
Twos complement of a given 3 or more bit binary number of non-zero magnitude is the same the original number if all bits except the?
ANSWER: MSB IS 1 In the 2's complement representation, the 2's complement of a binary number is obtained by first finding the one's complement (flipping all the bits), and then adding 1 to the result. This representation is commonly used to represent signed integers in binary form. Now, if all bits except the sign bit are the same, taking the 2's complement of the binary number will result in the negative of the original number. The sign bit (the leftmost bit) is flipped, changing the sign of the entire number. For example, let's take the 4-bit binary number 1101 The 2's complement would be obtained as follows: Find the one's complement: 0010 Add 1 to the one's complement: 0011
How is the two's complement representation used?
The "twos complement" is that marvelous manipulation of bits in computer binary code that allows the computer to subtact by adding. It would be difficult to explain the whole picture, but computers can really do nothing but add. So the natural question is, how do they then calculate differences? Two's complement is the answer.
What is meant by ones-compliment of a decimal number?
One-complement applies to binary values, not decimal values. Therefore when we say the ones-complement of a decimal value we mean convert the value to binary, invert all the bits (the ones-complement), then convert the result back to decimal. For example, the decimal value 42 has the following representation in 8-bit binary: 00101010 If we invert all the bits we get 11010101 which is 213 decimal. Thus 213 is the ones-complement of 42, and vice versa. However, it's not quite as straightforward as that because some (older) systems use ones-complement notation to represent signed values, such that 11010101 represents the decimal value -42. The problem with this notation is that the ones-complement of 00000000 is 11111111 which means the decimal value 0 has two representations, +0 and -0 respectively. In the real-world, zero is neither positive nor negative. To resolve this problem, modern systems use twos-complement to represent signed values. The twos-complement of any value is simply the ones-complement plus one. Thus the ones-complement of 42 becomes -43, therefore the twos-complement of 42 is -43+1 which is -42. Thus -42 is represented by the binary value 11010110 in twos-complement notation. With twos-complement, there is only one representation for the value 0. This is because the ones-complement of 00000000 is 11111111 and if we add 00000001 we get 00000000. Note that we don't get 100000000 because the result cannot have any more bits than were in the original value. When an "overflow" occurs, we cycle back to zero. As a result, incrementing and decrementing signed values has exactly the same logic as incrementing or decrementing unsigned values and flipping the sign of any value is only slightly more complicated by the extra addition operation. However, flipping the sign of a value is a much rarer operation than counting so the cost is trivial compared to the cost of counting operations using ones-complement (because there are two values for zero). Note that ones-complement notation allows an 8-bit value to store signed values in the range -127 to +127, whereas twos-complement allows a range of -128 to +127 (through the elimination of the extra zero). But in unsigned notation, both allow the same range: 0 to 255. Although we rarely encounter ones-complement notation, it is important to keep in mind that not all systems use twos-complement notation, particularly when working with low-level but portable programming languages. This is the reason why both the C and the C++ standards state that the range of an 8-bit signed value is only guaranteed to store values in the range -127 to +127.
How do you write a basic program find whether number is even or odd if even display its square and if odd display its cube?
Divide that number into 2 using modulus division. Modulus division get the remainder of the division. If it has no remainders, then it's an even number. If not, then it's an odd number. Here's a pseudo code of the program. ALGORITHM ODD_EVEN INPUT (number) IF (number MOD 2 == 0) THEN DISPLAY ("Even") ELSE DISPLAY ("Odd") END IF END ODD_EVEN Amendment: You did ask for a BASIC program: 10 INPUT X: IF X = 999 THEN STOP 20 PRINT X;: IF X/2 = INT(X/2) THEN PRINT "EVEN" ELSE PRINT "ODD" 30 GOTO 10
