Logical Operations Flashcards

(26 cards)

1
Q

What is a logic gate?

A

A logic gate is a fundamental component of a digital circuit that takes one or more inputs and produces a single output based on those inputs.

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

What do logic gates use to represent values?

A

1 (high voltage/True) and 0 (low voltage/False)

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

What is a truth table?

A

A truth table shows all possible input combinations for a logic gate and the corresponding output.

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

What is the conventional label for a logic gate output?

A

Q

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

What does a NOT gate do?

A

It inverts the input: if input is 1, output is 0; if input is 0, output is 1.

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

Boolean expression for a NOT gate?

A

Q = Ā

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

What does an AND gate do?

A

Produces 1 only if both inputs are 1.

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

Boolean expression for an AND gate?

A

Q = A ⋅ B

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

What does an OR gate do?

A

Produces 1 if at least one input is 1.

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

Boolean expression for an OR gate?

A

Q = A + B

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

What does an XOR gate do?

A

Produces 1 if only one input is 1 (not both).

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

Boolean expression for an XOR gate?

A

Q = A ⊕ B

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

What does a NAND gate do?

A

It outputs the inverse of an AND gate.

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

Boolean expression for a NAND gate?

A

Q = ¬(A ⋅ B)

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

What does a NOR gate do?

A

It outputs the inverse of an OR gate.

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

Boolean expression for a NOR gate?

A

Q = ¬(A + B)

17
Q

What are the components of a Boolean expression?

A

Variables (A, B, etc.), constants (1 and 0), and operators (AND, OR, NOT)

18
Q

What are Boolean identities?

A

Statements of equivalence between Boolean expressions used for simplification.

19
Q

Why simplify Boolean expressions?

A

To reduce logic gates, cost, heat, and processing time in circuits.

20
Q

What does the commutative law state?

A

A ⋅ B = B ⋅ A and A + B = B + A

21
Q

What does the associative law state?

A

A ⋅ (B ⋅ C) = (A ⋅ B) ⋅ C and A + (B + C) = (A + B) + C

22
Q

What does the absorption law state?

A

A + (A ⋅ B) = A and A ⋅ (A + B) = A

23
Q

What does the distributive law state?

A

A ⋅ (B + C) = A ⋅ B + A ⋅ C and A + (B ⋅ C) = (A + B) ⋅ (A + C)

24
Q

What is the first De Morgan’s law?

A

¬(A + B) = ¬A ⋅ ¬B

25
What is the second De Morgan’s law?
¬(A ⋅ B) = ¬A + ¬B
26
How do you apply De Morgan's laws (3 steps)?
1. Change the operator (AND ⇄ OR) 2. Negate each variable 3. Negate the whole expression and simplify