0
When computers went digital and moved into the modern times they have been running on Ones and Zeros. What we humans call the number 10 to a computer is 00001010. The computers way allows it to do calculations very quickly, very fast simply by the presents (1) or absents (0) of electricity.
Still curious? Ask our experts.
Chat with our AI personalities
Ezra
Coach
ViviAdd your answer:
Earn +20 pts
How do you add binary numbers?
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.
What is principal of Duality?
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
Which date came earlier 540 BCE or 240 BCE?
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.
How many years did Jason Bay play for the Red Sox?
1 & counting.
Circuit diagram of xor gate using minimum number of nand gates?
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).
