Скачать презентацию Logic Functions AND operation The binary AND
Logic Functions.pptx
- Количество слайдов: 14
Скачать презентацию Logic Functions AND operation The binary AND
Скачать презентацию Logic Functions AND operation The binary AND
Logic Functions
AND operation The binary AND operation has two inputs and one output. It is like the ADD operation which takes two arguments (two inputs) and produces one result (one output). The inputs to a binary AND operation can only be 0 or 1 and the result can only be 0 or 1 The binary AND operation (also known as the binary AND function) will always produce a 1 output if both of its inputs are 1 and will produce a 0 output if one or both of its inputs are 0. If we call the inputs A and B and the output C we can show the AND function as:
A B C 0 AND 0 -> 0 0 AND 1 -> 0 1 AND 0 -> 0 1 AND 1 -> 1
OR operation The binary OR operation has two inputs and one output. It is like the ADD operation which takes two arguments (two inputs) and produces one result (one output). The inputs to a binary OR operation can only be 0 or 1 and the result can only be 0 or 1 The binary OR operation (also known as the binary OR function) will always produce a 1 output if either of its inputs are 1 and will produce a 0 output if both of its inputs are 0. If we call the inputs A and B and the output C we can show the OR function as:
A B C 0 OR 0 -> 0 0 OR 1 -> 1 1 OR 0 -> 1 1 OR 1 -> 1
NOT operation The binary NOT operation has one input and one output. It is like the NEGATIVE operation which takes one argument (one input) and produces one result (one output). The input to a binary NOT operation can only be 0 or 1 and the result can only be 0 or 1 The binary NOT operation (also known as the binary NOT function or complement function or bit invert function) will always produce a 1 output if its input is 0 and will produce a 0 output if its input is 1. If we call the input A and the output B we can show the NOT function as:
A B NOT 0 -> 1 NOT 1 -> 0
XOR operation The binary XOR (exclusive OR) operation has two inputs and one output. It is like the ADD operation which takes two arguments (two inputs) and produces one result (one output). The inputs to a binary XOR operation can only be 0 or 1 and the result can only be 0 or 1 The binary XOR operation (also known as the binary XOR function) will always produce a 1 output if either of its inputs is 1 and will produce a 0 output if both of its inputs are 0 or 1. If we call the inputs A and B and the output C we can show the XOR function as:
A B C 0 XOR 0 -> 0 0 XOR 1 -> 1 1 XOR 0 -> 1 1 XOR 1 -> 0
NAND In digital electronics, a NAND gate (Negated AND or NOT AND) is a logic gate which produces an output that is false only if all its inputs are true; thus its output is complement to that of the AND gate.
INPUT OUTPUT A B A NAND B 0 0 1 1 1 0
NOR In Boolean logic, logical nor or joint denial is a truth-functional operator which produces a result that is the negation of logical or. That is, a sentence of the form (p NOR q) is true precisely when neither p nor q is true—i. e. when both of p and q are false. In grammar, nor is a coordinating conjunction.
INPUT OUTPUT A B A NOR B 0 0 1 0 1 0 0 1 1 0
a&b boolean logical AND a|b boolean logical OR a^b boolean logical exclusive OR !a logical NOT
Скачать презентацию Logic Functions AND operation The binary AND
Logic Functions.pptx