0
int complement (int n) {
return -n;
}
or int complement (int n) {
return ~n+1;
}
both does the same thing.
Wiki User
∙ 15y ago
Add your answer:
Earn +20 pts
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.
What is unsigned data types in turbo c?
The same as an unsigned type in any other implementation of C. An unsigned type is an integer that is guaranteed positive. Normally, the most-significant bit of an integer denotes the sign (positive or negative). Unsigned types use this bit to denote value, effectively doubling the range of positive values over that of the signed equivalent. For instance, a signed char has a guaranteed range of -127 to +127 while an unsigned char has a guaranteed range of 0 to 255. Note that a signed char typically has a valid range of -128 to +127, however this is only true on systems that utilise twos-complement notation. Those that use the older ones-complement notation have two representations for the value zero (one positive, one negative). Ones-complement simply inverts all the bits of a value to switch the sign of a value, whereas twos-complement adds the value 1 after inverting all the bits. The value zero is denoted as 00000000 in binary. Inverting the bits creates 11111111, which is minus zero on a ones-complement system and -1 on a twos-complement system. -1 + 1 is 0, hence we add 1 on a twos-complement system.
The 2's complement of the binary number 1101100 in BCD is?
I want answer bcd This in (a) 12 b() 13 (c)14 (d)15
How do you use this function in c programme?
I don't use that function in C programme.
The measure of angle C is 17.7 degrees what is the measure of the complement of angle C?
The complement of an angle C is (90 - C) So the complement of an angle of 17.7° is (90 - 17.7) = 72.3°
What is tilde operator in c and how its work?
In C, the tilde operator (~) is the bitwise NOT operator. It returns the ones-complement of its operand. That is, the individual bits of the input are inverted in the output, such that all 0s becomes 1s and all 1s become 0s. Note that the bitwise NOT (~) and logical NOT (!) operators are used for entirely different purposes. With logical NOT, the operator evaluates true (the all-ones bit pattern) when the operand is false (the all-zeroes bit pattern), which is exactly the same as the ones-complement used in bitwise NOT. However, if the operand represents anything other than the all-zeroes bit pattern, the output is the all-zeroes bit pattern. We can compare the two operators by examining what happens to the bits in each operation. Let's use the value 42 (binary 00101010) as the input. ~42 -43 !42 false Note that the binary value 11010101 represents -42 on a ones-complement system. However, most systems today use twos-complement notation for signed values, thus if we want to negate a value regardless of which notation is utilised by the system we must use the unary minus operator. On a twos-complement system, unary minus is equivalent to adding 1 to the ones-complement representation of the operand. Thus -42 is equivalent to (~42) + 1 = (~00101010) + 00000001 = 11010101 + 00000001 = 11010110 = -42.
1's complement of 1000?
Ones complement simply switches the state of all the bits (0s becomes 1s and 1s becomes 0s). Assuming 1000 is binary (for decimal 8), the 1's complement would be 0111. But if 1000 is really decimal one thousand, the binary equivalent would 1111101000, thus the ones complement would be 0000010111. Ones complement was originally used to represent signed integers. To flip the sign, all bits were flipped and the most-significant bit denoted the sign (0 for positive, 1 for negative). The problem with one's complement is that we end with two representations for the value zero: 00000000 and 11111111 in 8-bit notation. To eliminate this, most modern systems now use twos complement, which is ones complement plus one. Thus 00000000 is 11111111 + 00000001 which is 00000000. Note that ones complement notation means that an 8-bit value has a valid range of -127 through +127 (with two representations for zero) while twos complement gives us a range of -128 through +127. Signed integer notation is also system-dependent, hence the reason why a char data type in C only has a guaranteed range of at least -127 through +127 across all implementations. For that reason it is not safe to assume that -128 has a valid representation in 8-bit signed notation across all implementations.
Write a program of binary heap in c or c language?
to implement operations on binary heap in c
How do you represent -123 in twos complement in 10 bits register?
-123 = 11 1000 0101 [I presume the number 123 is in decimal] First write the positive number in binary using 10 bits (I've split it into groups of 4 bits to make it easier to read): 123 = 00 0111 1011 Convert to 1s complement by inverting all bits (any 0 => 1, any 1 => 0): 00 0111 1011 => 11 1000 0100 Finally add 1 to get 2s complement: 11 1000 0100 + 1 = 11 1000 0101 Thus the 2s complement of the negative number: -123 = 11 1000 0101 This can also be expressed in hexadecimal: -123 = 0x385 Or in octal (easy to convert if the binary number is first written in groups of 3 bits): -123 = 1 110 000 101 = 01605 [I've used C notation for the hexadecimal and octal numbers.]
What is the complement of the union B and C?
not (b or c) = (not b) and (not c)
Which one of the following strands of DNA in the complement strand to?
which one of the following strands od DNA in the complement strand to c-c-a-t-c-g
What is the meaning of 0x10000000 in embedded C programming using LPC2129?
The meaning is entirely dependent upon the data the value actually represents. As an unsigned integer, 0x10000000 represents the value 128. As a signed integer it would represent -127 on a ones-complement system and -128 on a twos-complement system. Regardless of its value, the meaning depends on what that value is supposed to represent. It could be an index into an array, a character code, a memory address, an instruction, or indeed anything the programmer desires it to mean. Ultimately it is just a binary representation for some piece of information that is stored digitally. We (humans) can interpret it as a number, but to the computer it is nothing more than a binary code. What that code represents is entirely open to interpretation.
