Back to marketplace

1.4.3 Boolean Algebra

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

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

Card preview (24)

#1
Front (Question)

How can problems be defined?

Back (Answer)

Using boolean logic in boolean equations

#2
Front (Question)

What results can come from a boolean equation?

Back (Answer)

True False

#3
Front (Question)

What is the name given to the conjunction operation?

Back (Answer)

AND

#4
Front (Question)

What is the symbol given to the conjunction operation?

Back (Answer)

ʌ

#5
Front (Question)

What is the shape given to the conjunction operation?

Back (Answer)

D

#6
Front (Question)

What is the name given to the disjunction operation?

Back (Answer)

OR

#7
Front (Question)

What is the symbol given to the disjunction operation?

Back (Answer)

V

#8
Front (Question)

What is the name given to the negation operation?

Back (Answer)

NOT

#9
Front (Question)

What is the symbol given to the negation operation?

Back (Answer)

¬

#10
Front (Question)

What is the shape given to the negation operation?

Back (Answer)

▷

#11
Front (Question)

What name is given to the exclusive disjunction operation?

Back (Answer)

XOR

#12
Front (Question)

What symbol is given to the exclusive disjunction operation?

Back (Answer)

V̲

#13
Front (Question)

What is a truth table?

Back (Answer)

A table showing every possible combination of inputs to a logic gate and corresponding output

#14
Front (Question)

How are boolean equations made?

Back (Answer)

By combining boolean operators

#15
Front (Question)

What is a Karnaugh map?

Back (Answer)

A method of simpiflying boolean expressions

#16
Front (Question)

Describe how boolean expressions can be simplified using Karnaugh map.

Back (Answer)

Write truth table as a Karnaugh map Highlight groups of 1s in map Remove variables which change within rectangles Keep variables which do not change

#17
Front (Question)

How can expressions be simplified using De Morgan’s Law?

Back (Answer)

¬(A ʌ B) = ¬A v ¬B ¬(A v B) = ¬A ʌ ¬B

#18
Front (Question)

How can expressions be simplified using Distribution Law?

Back (Answer)

A ʌ (B v C) = (A ʌ B) v (A ʌ C) A v (B ʌ C) = (A v B) ʌ (A v C) A ʌ (B ʌ C) = (A ʌ B) ʌ (A ʌ C) A ʌ (B v C) = (A v B) v (A v C)

#19
Front (Question)

How can expressions be simplified using Association Law?

Back (Answer)

(A ʌ B) ʌ C = A ʌ (B ʌ C) = A ʌ B ʌ C (A v B) v C = A v (B v C) = A v B v C

#20
Front (Question)

How can expressions be simplified using Commutation Law?

Back (Answer)

A v B = B v A A ʌ B = B ʌ A

#21
Front (Question)

How can expressions be simplified using Double Negation Law?

Back (Answer)

¬¬A = A

#22
Front (Question)

What is the purpose of a D-type flip flop?

Back (Answer)

To store the value of a single bit

#23
Front (Question)

When is the stored value in a D-type flip flop updated?

Back (Answer)

On the rising edge of the clock signal

#24
Front (Question)

Which logic gates are used in the logic circuit of a D-type flip flop?

Back (Answer)

4 NAND gates