It is quite easy. Try to follow this example. 01100111 01010011 = 10111110 Method : Same as in Decimal system, but highest possible number is 1. Start at the last digits First place is 1+1 = 0 and carry one Second place is 1+1+the CarryBit 1 =1 and carry one. Third place is 1+0+the CarryBit 1 = 0 and carry one. Fourth place is 0+0+the CarryBit 1 = 1 and carry zero. Fifth place is 0+1 and No CarryBit = 1 and carry zero. Sixth place is 1+0 and No CarryBit =1 and carry zero. Seventh place is 1+1 and No CarryBit = 0 and carry one. Eighth place is 0+0 + the CarryBit 1 = 1 and carry none. Cheers.
According to principle of duality"Dual of one expression is obtained by replacing AND (.)with OR(+) and OR with AND together with replacement of 1 with 0 and 0 with 1. For example: consider the expression A+B=0. The dual of this expression is obtained by replacind + with . and 0 by 1. ie A.B=1 is dual of A+B=0
540 BCE. In years BCE (BC), the years count backward until the year 1 BCE is reached. The year 1 CE (AD) immediately follows 1 BCE, and begins counting upward; there is no year 0.
1 & counting.
The XOR gate (sometimes EOR gate, or EXOR gate) is a digital logic gate that implements an exclusive or; that is, a true output (1) results if one, and only one, of the inputs to the gate is true (1). If both inputs are false (0) or both are true (1), a false output (0) results. Its behavior is summarized in the truth table shown on the right. A way to remember XOR is "one or the other but not both". It represents the inequality function, i.e., the output is HIGH (1) if the inputs are not alike otherwise the output is LOW (0).
1
It is called binary arithmetic.
Use the binary system.
The product is an integer that may or may not be a counting number.All integers are whole numbers.The counting numbers are {1, 2, 3, ...}The integers are the counting numbers along with 0 and the negative counting numbers, ie {..., -3, -2, -1, 0, 1, 2, 3, ...}The product of two of these is an integer that will be:a negative counting number {..., -3, -2, -1} - the first integer is a counting number, the second is a negative counting numberzero {0} - either, or both, number is zeroa counting number {1, 2, 3, ...} both integers are negative counting numbers.
Addition of binary is the computers way of counting (adding). Computers don't have the normal numerical system like us e.g. 1-9, they only have 'bits'- 0 and 1. the rules for the of addition of binary are as follows: 0+1=1 1+0=1 0+0=0 1+1=0 (carry one) 1+1+carry=1 (carry one) the final carry is just placed on the left hand side of the answer. Hope this helps (:(:(:
Ithink it's called binary Ithink it's called binary
Nothing, except whole numbers include 0 (zero) while counting numbers start with 1 (one)
The counting numbers are {1, 2, 3, ...}. The integers are the counting numbers, their opposites (-1, -2, ...) and zero. So they are {..., -2, -1, 0, 1, 2, ...}.
Natural numbers start with "0" while counting numbers start with "1".
All computers start counting at 0, not 1.
Integers
It is a definitional thing. Counting numbers are whole numbers (integers) starting with 1.