Having a problem with the original code complement? What does the source code and complement mean

in the computer system.

, numeric values, all with complements.

to represent and store.

Original and reverse codes.

In computers, none of them exist.

Use the complement to represent positive and negative values, and you can convert negative numbers into positive numbers for calculation.

This saves hardware and only uses an adder.

Addition and subtraction can be realized.

Complement, what does it mean? This has to start with [complements].

The number of digits calculated by the computer is fixed, such as an eight-bit computer...

After the number of digits is limited, the counting range has periodicity.

Such as two-digit decimal.

0 99, the period is 100 (one hundred).

Then, minus one, you can replace it with +99:

25 + 99 = (one hundred) 24

Discarding the carry and taking only two digits, the functions of these two algorithms are the same.

This uses a positive number instead of a negative number! With addition, subtraction is realized!

99 is the complement of 1. Calculation formula: Complement Period Negative Number.

Studied trigonometric functions.

As you know, the function period.

Yes: 2 (360°).

Then 90° can also be calculated by +270°. The same is true.

A negative angle, how to calculate the "equivalent positive angle", everyone will know.

Binary for computers.

Complement is renamed as Complement.

Octal binary: 0000 0000 1111 1111.

Corresponds to decimal: 0 255.

The counting period is: 2 8 = 256.

Then, the complement of 1 is 256 + 1) = 255 = 1111 1111 (binary).

The complement of 2 is: 254 = 1111 1110.

The complement of 128 is: 128 = 1000 0000.

This is also the result of using the non-existent "original code reverse code to take back plus one".

The formula for finding the complement of a negative number is also: period + the negative number.

Positive numbers, this formula can also be used. However, after calculation, the value of this period, which is out of the counting range, is omitted. In the end, it's still this positive number.

For example: 7 3 = 4.

The process of calculating with complement is as follows:

7 of the complement 0000 0111

3 of the complement 1111 1101

Add to give (1) 0000 0100 = 4 complements.

Discarding the carry and leaving only eight digits as a result, we find 7 3.

Both the original code and the reverse code are non-existent and useless in the computer.

They're just in the hands of the computer teacher.

1: Let's take a look at the process of finding the complement: reverse the original code, add 1, and get the complement.

For example, 1001, after it is all reversed, it is 0110, and 1 is added to get 0111. Add the original code to the complement code and you will get 10000. We should know that the most basic combinator of the computer can only do addition, so it is called an accumulator, and it cannot do subtraction.

So when we need to subtract, we take the complement of the subtraction and use the subtracted number to add this complement. If it is 1111-1001=0110, it is equivalent to 1111-(10000-0111)=1111+0111=0110, where 0111 is the complement of 1001. Because the code is not like a number, the code is limited by the number of digits, and it is not manifested when there are more than its number of digits, so subtracting the original code of a number is equivalent to adding its complement.

I believe that if you understand this article, the third problem will be solved. 2.Stipulate ......Conventionally, that's what I said at the beginning, anyway, binary is two numbers, either 0 or 1, and the negation is the other party.

1 to 0 is greater, and a positive number is ...... larger than a negative numberThat's what I think, I'm not sure. 4.If you don't remember the symbol bits, the original code + complement code = 100....

0 (the number of digits of 0 is the same as the position of the original code), then do you say that these two codes are the original complement of each other? After taking the complement, taking the complement again is itself.

The principle of complement is mathematics.

It is not something that can be explained by a simple operation such as "taking and adding one".

In mathematics, there are some laws of change that are periodic.

So, just understand what is within a cycle, and that's fine.

For example, a three- or four-year-old child can only count a hundred: 0 99.

At 100 (10 2), it's all over again.

That's a cycle.

Moreover, he will only do addition, not subtraction.

Then, you can teach him to use addition to calculate subtraction

25 + 99 = (one hundred) 24

Don't carry it, just keep two digits, in this case, +99 can be used as a 1.

In the same way, 98 can replace 2.

These positive numbers, which replace negative numbers, are the "complements of negative numbers".

The formula is calculated as a complement negative period (10 n).

n is the number of digits of a complement.

Computers use binary, which is called "complement".

The 8-digit base number is: 0000 0000 1111 1111 (decimal 255).

The counting period is: 2 8 = 256.

Then, the complement of 1 is: 1 + 256 = 255 = 1111 1111.

2, the complement is: 2 + 256 = 1111 1110.

Positive numbers must be calculated directly and are not allowed to change.

So, positive, there is no complement.

Complements are very simple things.

The complement code has nothing to do with the original code reversal.

If you use the inverted plus one to find the complement, you will not understand the meaning of the complement.

People who are engaged in computers generally do not go to school well, and their math level is very low, and they can't explain reasonably, so they can only bluff people by doing some bad operations.

The original code of 128 is 10000000The highest digit of an 8-bit binary number with a signed bit is the sign bit, a negative number is 1, and a positive number is 0So the maximum positive number is 011111111, 0 has no sign, so 000000000 is used to represent 0, 100000000 is not with the table 0, -127 binary is 11111111, minus 1 is to add -1 (10000001) the result is 1100000000, the ninth bit overflow rounding result is 10000000, negative original code complement conversion relationship, original code = complement by bit, positive original code complement is the same, 10000000 is reversed to 01111111 10000000 after adding 1

The question you are asking is asking why the apple falls to the ground and not to the sky??? Why do you say??

The original code, which doesn't make any sense.

Complement has the function of replacing negative numbers with positive numbers and turning subtraction into addition.

In this way, only one adder is needed to add and subtract in the computer.

So, in a computer, just use the complement. There is no need for original and reverse codes at all.

For clocks, if you turn back 4 hours, you can use a forward 8 hours instead.

For decimal numbers, subtract one, which can be replaced by +99.

For example: 24 1 = 23

Ignore the carry and only take the lower two digits, and the result will be the same.

The positive number used here instead of a negative number is called a "complement".

Computers use binary, which is called "complement".

Positive numbers, you can do it directly, no need to find the complement.

The complement of a negative number is: modulus the negative number.

The eight-digit binary modulo is: 2 to the 8th power of 256.

The complement of 1 is: 256 1 = 255 = 1111 1111 (binary).

The complement of 2 is: 256 2 = 254 = 1111 1110 (binary).

The complement of 128 is: 256 128 = 128 = 1000 0000 (binary).

To find the complement, it can be obtained by formula, and there is no need to bypass the original code inverse symbol bit.

The source code is directly converted to binary. Complements are symbolic bits that make no difference for positive numbers and not the same for negative numbers. Like what. -1, the complement represented by 8 bits is 11111111

Knowing the complement of a number, the operation of finding the original code is actually to find the complement and then find the complement:

1. If the symbol bit of the complement is "0", it means that it is a positive number, and its original code is the complement.

2. If the sign bit of the complement is "1", which means that it is a negative number, then the complement of the given complement is the required original code.

For example, if a complement is known to be 11111001, then the original code is 10000111 (-7). Because the sign bit is "1", which means that it is a negative number, the bit remains unchanged and remains "1".

The remaining seven 1111001 are 0000110; Add 1 more, so it's 10000111.

Rock Ridge as a computer: Lenovo hides the ThinkPad

Operating system: Windows 10.

The original code can be transformed to find the complement by the conversion rule, and the specific method is as follows:

1. First of all, we must know the conversion rules, the original code is converted to the reverse code, the symbol bit remains unchanged, and the numerical bit is inverted by bit. (as shown in the image below).

2. Then the reverse code is converted to the original code is the same, but the rules are different, the symbol bit remains unchanged, and the numerical bit is reversed according to the bit. (as shown in the image below).

3. Then, the rule that the original code is converted to the complement code, the symbol bit remains unchanged, the numerical bit is inverted by bit, and the last bit is added by 1. (as shown in the image below).

4. Finally, the complement is converted into the original code, the symbol bit remains unchanged, the numerical bit is reversed by bit, and the last bit of the coarse infiltration is added by one, that is, the complement of the complement is equal to the original code. (as shown in the image below).

5. The conversion rules of the complement are different from the previous ones, the sign bit and the numerical bit are inverse, and the last digit is added by 1. (as shown in the image below).

Other ways to find the complement of the original code:

The decimal fraction original code and the complement code can be expressed as binary numbers respectively, and then the binary decimal number can be calculated, 7 16=0111b 2 4=, so that it is easy to find the original code, inverse code, and complement of the decimal number. <>

Signed numbers, which can be changed into various **, see Fig.:

However, both the original code and the reverse code do not exist in the computer.

Only the complement code is a practical code.

The law of its transformation can be found out by itself.

Complement, in fact, is a positive number that [operates instead of a negative number].

When you replace negative numbers with complements, negative numbers don't exist in your computer.

As a result, there is no subtraction in the computer.

In other words, with the help of complements, the calculations can be simplified. It also simplifies the hardware.

How can a complement (a positive number) be used to "replace a negative number"?

Let's look at the 2-digit decimal arithmetic:

28 + 99 = one hundred) 27

As long as you ignore the carry (10 2), the function of +99 and 1 is the same.

In this case, +99 is said to be the complement of 1.

In the same way, +98 is the complement of 2.

You can also derive the formula for finding complements:

Complement negative number + 10 n, n is the number of digits of complement.

ComputersWith binary, complement, renamed as: complement.

For 8-bit binary, the complement should be found as follows:

Formula: Complement Negative + 2 n, n is the number of bits of the complement.

8-bit base, which can make up a total of 2 8 = 256 sets of complements.

This includes 128 negative complements.

As follows: [1] Complement = 2 8 1 = 255 = 1111 1111 (binary).

2] complement = 2 8 2 = 254 = 1111 1110 (binary).

128] complement = 256 128 = 128 = 1000 0000.

Positive, non-transformable, must directly participate in the operation.

So, positive, there is no complement.

Neither the source code nor the reverse code has the function of simplifying the hardware.

Therefore, in the computer, only the complement code is used, and the original code and reverse code are not used at all.

To find the complement, don't take the road of "the original code is reversed and the symbol bit is added to the one".

Otherwise, you wouldn't know: Ho? For? Repair? Yard?

Calculated with eight-digit complement: 7 5 = 2.

5] complement =

Add

Carry more than 8 digits, just discard it.

From this calculation, it can also be seen that:

When you use complement and subtraction, you convert it to addition.

The original code is reversed, and there is no such function.

So, in the computer, there is no shadow of them at all.

Original: In the number represented by the binary original code, the sign bit 0 represents a positive number, the sign bit 1 represents a negative number, and the rest of the digits represent the numeric part. For example, 10000010 means -2,00000010 means 2.

Anti-code: The definition of anti-code is as follows:

For positive numbers, its inverse representation is the same as the original. i.e. [x] anti = [x] original.

For negative numbers, except for the sign bit which is still "1", the rest of the "1" is replaced with "0", and "0" is replaced with "1", that is, the inverse code [x] is obtained. For example, [11101001] inverse=10010110.

For 0, it has two representations of inverse codes: [+0] inverse=00....0 [-0] anti = 11....1

Complement: The complement of a positive number is the positive number itself.

01100100] Supplement 01000100

For negative numbers: the sign bit remains unchanged, and the inverse code is added by 1.

10100100] Supplement 11011011

0] complement [-0] complement 00....0。

Hope mine can help you.