Logic Circuits and Truth Tables (AQA GCSE Computer Science): Flashcards

📚Flashcards
Logic Circuits and Truth Tables
Sign up to keep revising.Create a free account to study more flashcards and track your progress.

Practise the cards

15 cards from this deck

Show

Combined logic circuit definition

Two or more logic gates connected together

XOR gate output condition

Outputs 1 when exactly one input is 1, not both

NAND gate composition

NOT gate connected to AND gate output

Boolean expression for NAND

P=NOT(A AND B)P = \text{NOT}(A \text{ AND } B)

Formula for truth table rows with nn inputs

2n2^n rows

Truth table rows for 3 inputs

23=82^3 = 8 rows

Boolean: P=(A AND B) OR CP = (A \text{ AND } B) \text{ OR } C - circuit structure

AND gate output fed to OR gate with third input

Boolean: P=(A XOR B) AND CP = (A \text{ XOR } B) \text{ AND } C - circuit structure

XOR gate output fed to AND gate with third input

AND gate rule

Needs ALL inputs to be 1

OR gate rule

Needs AT LEAST ONE input to be 1

XOR gate rule

Needs EXACTLY ONE input to be 1

NOT gate rule

Flips whatever it receives

Reading Boolean expressions order

Read from inside out (brackets first)

Boolean logic order of operations

NOT first, then AND, then OR, then XOR

NAND gates universal property

Can be used to build any other type of logic gate

Join 100,000+ GCSE students studying Flashcards with us.

Select your subjects, and get access to A+ resources today.