Digital Logic Design Flashcards

1
Q

What does binary logic consist of?

A
  • Binary Variables (letters that represent either 1 or 0)

- Logical operations (AND, OR, NOT)

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

What is the notation for AND?

A

x⋅y

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

What is the notation for OR?

A

x+y

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

What is the notation for NOT?

A

x’ or x̄

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

What is the switching circuit convention?

A

Open switch = 0

Closed switch = 1

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

What is the solid state circuit convention?

A

Logic 1 is represented with a high voltage
Typically 3.3V or 5V (approximately)

Logic 0 is represented with a low voltage
Usually 0V (approximately)

**Note values on pg 32 in textbook, has to be around 0 and around 3.3 not exactly those numbers

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

What does the AND symbol gate look like?

A

Check white binder

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

What does the OR symbol gate look like?

A

Check white binder

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

What does the NOT symbol gate look like?

A

Check white binder

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

What are the basic rules of boolean algebra?

A

Has a set of two elements. B = {0.1}
Has the two binary operators · and + (AND and OR)
Their results are strictly defined (can only be 0 or 1)

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

What are the basic postulates of boolean algebra?

A
  • Closed with respect to + and ·
    The result of these operations is always 0 or 1
  • The identity element for + is 0
    x + 0 = 0 + x = x
  • The identity element for · is 1
    x · 1 = 1 · x = x
  • Commutative with respect to + and ·
    x + y = y + x
  • · is distributive over +
    x · (y+z) = (x · y) + (x · z)
    • is distributive over ·
      x + (y · z) = (x+y) · (x + z)
  • For every x there exists a complement x’ that satisfies the rules x + x’ = 1 and x · x’ = 0
  • There are at least two elements x and y in the set of elements B such that x != y
How well did you know this?
1
Not at all
2
3
4
5
Perfectly