The question could have been written better. I am assuming that you have two inputs each denoted by "a" and want to know which logic function requires both "a"s to be (1 or TRUE) so that the output is 1. The logic function is an AND gate
Boolean is a 'true or false' logic in programming - if you define a function as a Boolean function, the only inputs it can have are true or false, and the output will vary dependant on the input
The acronym NAND is the short version of "Not AND". In terms of logic gates, a NAND gate refers to an output that is false only when all of its inputs are true.
a method of classification
multiplexer
Boolean algebra is used in logic circuits. Using And, Nor, Xor and Nand gates to determine the state of an output, dependant on the condition of various inputs. Or, if you like, to make a fixed decision based on the inputs. When designing a logic circuit, it is easy to get confused by too many steps in the process to get the answer that you want. By using Boolean algebra, the steps can be rationalised and reduce to the minimum number of steps, before committing to a finished physical circuit.
AND.
NAND
An OR requires either input or both inputs to be a one. An Exclusive OR (EXOR or XOR) requires only one of the inputs to be a one and is a zero if both inputs are one.
A "Nand" gate is an "And" gate with an "Inverter" added to its output. To get a logic 1 output from a "Nand" gate, you need a logic 0 on both of its inputs. If I understand your question correctly, you have three "Nand" gates. Presumably the outputs of two of them are connected to the inputs of the third. Logic 1 at both inputs of the first two "Nand" gates will produce a logic 0 output from both of them. The two logic 0's are fed to the inputs of the third "Nand" gate producing a logic 0 output from the third "Nand" gate.
A NAND gate is digital logic device which will have 2 or more inputs which can be logic 1 or logic 0 (on or off, high or low) with all the inputs at logic 0 the output will be at logic 1, the only time the output will switch to a logic 0 is when ALL the inputs are at logic 1. here is a simple "truth table" To show the basic operation Input1 Input2 Output Off--------Off------- On Off--------On------- On On--------Off------- On On------- On------- Off NAND stand for not AND therefore a false will be present on the output only when both input are true ANSWER: NAND stands for NOT AND it simply negate the function. The only time that the output can be false if all inputs are true. In logic functions there is no ON-OFF it is either true or false "1" or "0"
Boolean is a 'true or false' logic in programming - if you define a function as a Boolean function, the only inputs it can have are true or false, and the output will vary dependant on the input
The NAND gate has two or more inputs, and one output. This output is the complement of the AND of all the bits and will only be 0 if all the inputs are 1.A NOT gate on the other hand has only 1 input, and the output is the complement of this input.So to make a NAND gate into a NOT gate, we should tie (short, connect to same value) all the inputs of the NAND gate. At the output we would have the complement of the signal given at the tied inputs.This way we have a NOT gate from a NAND gate.
Short the inputs together. Logic: A High input, with the inputs shorted together, will be H+H at the input side of the NAND gate, therefore resulting in a low output. A Low input, with both inputs shorted together, is L+L for inputs, resulting in a High output. Also, a NOR gate can be used in exactly the same way.
This would be the "AND" operator. 1 AND 1 = 1.1 AND 0 = 0. 0 AND 0 = 1
NAND gate
A four input and gate is a logic gate with four inputs. The output is true only when all four inputs are true.
Logic gate