Logic Flashcards

Logic gates, Boolean expressions and Karnaugh maps

You may prefer our related Brainscape-certified flashcards:
1
Q

NOT logic gate

A

▶o

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

AND logic gate

A

D

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

OR logic gate

A

)> (concave and pointy ver of and)

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

XOR logic gate

A

) )> (same as or with added curved line in front)

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

AND boolean symbol

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

OR boolean symbol

A

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

XOR boolean symbol

A

v with line underneath

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

NOT boolean symbol

A

¬

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

order of precedence for boolean expressions

A

Brackets
NOT
AND
OR and XOR

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

Double Negation

A

If there are two nots in front of a letter they can be erased

¬¬A = A

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

Commutation

A

The order of letters around an operator can be changed (remember the NOT symbol stays with the letter)

A v ¬B = ¬B v A

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

Association

A

If a long expression contains only one operator, letters can be reordered, and brackets can be added or taken away

A ^ B ^ ¬C = ( A ^ ¬C) ^ B

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

Distribution

A

If there is more than one operator, letters outside brackets can be “distibruted” to the letters inside the brackets

A v ( B ^ C ) = ( A v B) ^ ( A v C )

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

De Morgan’s Law

A

If there is a NOT outside of a bracket, it can be added to the letters inside, but the operator must change

¬( A v B) = ¬A ^ ¬B

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

What is a Karnaugh Map

A
  • A summary version of a truth table used to simplify logic expressions
  • Can have up to 4 inputs (2 per axis)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How are inputs written on the axis of a Karnaugh map

A

not in binary number order. They are written like this :

00
01
11
10

so that only 1 bit changes at a time.

17
Q

How Karnaugh maps correspond to a truth table

A

Each row of a truth table matches a square of a karnaugh map

18
Q

How Karnaugh maps correspond to a logical expression

A
  • look at each part of the expression
  • find the value of that part (such as AvB) and fill in a 1 in all squares that match that condition.
19
Q

How to mark groups in a karnaugh map

A
  • Must have 1, 2, 4, or 8 1s.
  • Squares or rectangles only
  • Can overlap
  • no 1s must be left out
  • groups as big as possible
20
Q

How to use karnaugh map to create logical expression

A
  • Describe each group, connect using AND operator.