Logic Circuits and Truth Tables (AQA GCSE Computer Science): Flashcards
📚Flashcards
Practise the cards
15 cards from this deck
ShowHide
Practise the cards
15 cards from this deck
Combined logic circuit definition
Combined logic circuit definition
Two or more logic gates connected together
XOR gate output condition
XOR gate output condition
Outputs 1 when exactly one input is 1, not both
NAND gate composition
NAND gate composition
NOT gate connected to AND gate output
Boolean expression for NAND
Boolean expression for NAND
Formula for truth table rows with inputs
Formula for truth table rows with inputs
rows
Truth table rows for 3 inputs
Truth table rows for 3 inputs
rows
Boolean: - circuit structure
Boolean: - circuit structure
AND gate output fed to OR gate with third input
Boolean: - circuit structure
Boolean: - circuit structure
XOR gate output fed to AND gate with third input
AND gate rule
AND gate rule
Needs ALL inputs to be 1
OR gate rule
OR gate rule
Needs AT LEAST ONE input to be 1
XOR gate rule
XOR gate rule
Needs EXACTLY ONE input to be 1
NOT gate rule
NOT gate rule
Flips whatever it receives
Reading Boolean expressions order
Reading Boolean expressions order
Read from inside out (brackets first)
Boolean logic order of operations
Boolean logic order of operations
NOT first, then AND, then OR, then XOR
NAND gates universal property
NAND gates universal property
Can be used to build any other type of logic gate
