Boolean algebra Flashcards

(18 cards)

1
Q

what is a logic gate?

A

an electronic circuit designed to perform logical operations on one or more binary inputs to produce a single output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

what is a truth table?

A

a table that lists all possible combinations of inputs and their corresponding outputs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

how is a NOT gate represented?

A

symbol: triangle pointing in direction of flow with a circle next to it, 1 input, 1 output
mathematical: ¬A
engineering: A̅

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

draw the truth table for a NOT gate (negation)

A

A | Q
1 | 0
0 | 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

how is an AND gate represented?

A

symbol: looks like a D with 2 inputs, 1 output
mathematical: A ∧ B
engineering: A.B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

draw the truth table for an AND gate (conjunction)

A

A | B | Q
0 | 0 | 0
0 | 1 | 0
1 | 0 | 0
1 | 1 | 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

how is an OR gate represented?

A

symbol: like a curved arrowhead - pointy end up front, curved end behind, 2 inputs, 1 output
mathematical: A ∨ B
engineering: A + B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

draw the truth table for an OR gate (disjunction)

A

A | B | Q
0 | 0 | 0
0 | 1 | 1
1 | 0 | 1
1 | 1 | 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

how is an XOR gate represented?

A

symbol: like an OR gate but with an extra line behind it too
mathematical: A ⊻ B
engineering: A ⊕ B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

draw the truth table for an XOR gate (exclusive disjunction)

A

A | B | Q
0 | 0 | 0
0 | 1 | 1
1 | 0 | 1
1 | 1 | 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

what strategies can be used to simplify a boolean expression?

A
  • collecting like terms
  • factorising
  • following the laws to simplify expressions within the expression
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

what are the general rules of boolean algebra?
(all here in engineering coz its easier)

A

A.0 = 0
A.1 = A
A.A = A
A.A̅ = 0
A + 0 = A
A + 1 = 1
A + A = A
A + A̅ = 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

what is the commutative law of boolean algebra?
(in engineering notation)

A

A + B = B + A
A.B = B.A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

what is the associate law of boolean algebra?

A

A + (B + C) = (A + B) + C
A.(B.C) = (A.B).C

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

what is the distributive law of boolean algebra?

A

A.(B + C) = A.B + A.C
A + (B.C) = (A+B).(A+C)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

what is the absorption/redundancy law of boolean algebra?

A

A + A.B = A
A.(A + B) = A

17
Q

what are de Morgan’s laws of boolean algebra?

A

(A̅+̅B̅) = A̅.B̅
(A̅.̅B̅) = A̅ + B̅
(basically break the bar, change the sign)