Back to marketplace

1.4.3 Boolean Algebra

No description yet. This curated deck is ready for daily study.

Total cards: 23•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (23)

#1
Front (Question)

1.4.3 A) What are the four main logic gates

Back (Answer)

AND OR NOT XOR

#2
Front (Question)

1.4.3 A) What is the symbol and operation of the AND logic gate.

Back (Answer)

Conjunction symbol - ^

#3
Front (Question)

1.4.3 A) What is the symbol and operation of the OR logic gate.

Back (Answer)

Disjunction symbol - V

#4
Front (Question)

1.4.3 A) What is the symbol and operation of the NOT logic gate.

Back (Answer)

Negation symbol - ¬

#5
Front (Question)

1.4.3 A) What is the symbol and operation of the XOR logic gate. Gate look

Back (Answer)

DIsjunction symbol - ⊻ the gate looks like a or gate with a line at the font (check notes)

#6
Front (Question)

1.4.3 B) What do truth tables show

Back (Answer)

all possible permuations of in input.

#7
Front (Question)

1.4.3 B) truth table for AND, where a and b are inputs and y is the output

Back (Answer)

A B Y 0 0 0 0 1 0 1 0 0 1 1 1

#8
Front (Question)

1.4.3 B) truth table for OR, where a and b are inputs and y is the output

Back (Answer)

A B Y 0 0 0 0 1 1 1 0 1 1 1 1

#9
Front (Question)

1.4.3 B) truth table for NOT, where a is the input and y is the output

Back (Answer)

A Y 0 1 1 0

#10
Front (Question)

1.4.3 B) truth table for XOR, where a and b are inputs and y is the output

Back (Answer)

A B Y 0 0 0 0 1 1 1 0 1 1 1 0

#11
Front (Question)

1.4.3 B) How do you know how many inputs are needed for a table

Back (Answer)

2^n where n is the number of inputs.

#12
Front (Question)

1.4.3 B) What is the need to simplify Boolean expressions

Back (Answer)

Logic gates represent electrical circuits, so its important to use as little as possbile. reduce size of the circuit reduce cost reduce power consumption quicker execution

#13
Front (Question)

1.4.3 B) Karnaugh maps

Back (Answer)

just check notes

#14
Front (Question)

1.4.3 C) What is demogans law

Back (Answer)

Involves breaking a negative and dchaing the operation. ¬(A∪B)= ¬A∩¬B ¬(A∩B) = ¬A∪¬B

#15
Front (Question)

1.4.3 C) What is the distribution rule

Back (Answer)

conjunction over disjunction A^(BvC) = (A^B)V(A^C) disjunction of conjunction AV(BvC) = (AVB)^(AVC)

#16
Front (Question)

1.4.3 C) What is the association law

Back (Answer)

(A^B)^c = A^(B^C) (AVB)Vc = AV(BVC)

#17
Front (Question)

1.4.3 C) commutation

Back (Answer)

order doesnt matter AVB = BVA B^A = A^B

#18
Front (Question)

1.4.3 C) double negative law

Back (Answer)

¬¬ A = A

#19
Front (Question)

1.4.3 E) What is a D-type flip flops

Back (Answer)

Logic circuit which can store the value of 1 bit.

#20
Front (Question)

1.4.3 E) How does D-type flip flops work. inputs and outputs

Back (Answer)

Has 2 inputs control signal and clock input. A clock is a regular pulse generated by CPU used to coordinate components. A clock pulse rises and falls (shown in notes). The output can only change at a rising edge. the start of a clock tick.

#21
Front (Question)

1.4.3 E) What is an adder

Back (Answer)

Is a logic circuit which adds together the number of inputs.

#22
Front (Question)

1.4.3 E) Half adder

Back (Answer)

Two inputs and two outputs (diagram in notes + truth table)

#23
Front (Question)

1.4.3 E) Full adder

Back (Answer)

Three inputs and 2 outputs allows for a carry to be represented. (diagram in notes + truth table)