Logic Gates and Boolean Flashcards

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

A . NOT(A) =

A

0

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

A . A =

A

A

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

A+A =

A

A

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

A + NOT(A) =

A

1

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

A + 0 =

A

A

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

A + 1 =

A

1

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

A . 0 =

A

0

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

A . 1 =

A

A

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

Commutative rule

A
YX = XY
Y+X = X+Y
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Associative rule

A
X(YZ) = (XY)Z
X+(Y+Z) = (X+Y)+Z
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

A(BC) =

A

(AB)C

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

Distributive rule

A

X(Y+Z) = XY + XZ

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

(X+Y)(W+Z) =

A

XW + XZ +YW +YZ

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

De Morgan’s Law

A

NOT(AB) = NOT(A) + NOT(B)

OR to AND/AND to OR and invert the NOTs

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

Why is the NAND gate universal?

A

Any type of gate can be formed from NANDS alone.

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

Why minimise the number of gate types used?

A
  • Lower manufacture costs
  • Higher processing speed
  • Reduce power consumption