Chapter 2 Flashcards

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

Convert binary to decimal
101011
10011
1001001

A

43
19
73

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

Convert decimal to binary:
35
67
14

A

100011
1000011
1110

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

Conversion method for twos complement.

A
  1. Change the sign to get the magnitude of the number, invert the binary number and add 1
  2. Convert to decimal.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Transistor based design

A

nMOS conducts on 1 and not on 0

cMOS does not conduct on 1, but does connect on 0

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

Boolean algebra symbols

A

Not ‘
Or +
And &

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

Literal

A

An appearance of a variable in either true or complemented form a’ or a

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

Variable

A

Represents a quantity (1 or 0)

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

Product term

A

Product of literals

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

Sum of products

A

An equation written as an ORing of product terms
abc’ + abc
Not correct form:
(ab + ab’)’

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

Communicative property

A

a + b = b + a

a * b = b * a

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

Distributive

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
11
Q

Associative

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
12
Q

Identity

A

a + 0 = a

1 * a = a

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

Complement

A

a + a’ = 1

a * a’ = 0

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

Idepotent

A

a + a = a

a * a = a

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

Involution Law

A

(a’)’ = a

16
Q

DeMorgan’s Law

A

(a + b)’ = a’b’

(ab)’ = a’ + b’

17
Q

Canonical Form

A

The standardized representation of a Boolean function

18
Q

Minterm

A

Product term whose literals include every variable in the function exactly once

19
Q

Sum - of - minterms

A

An equation in sum-of-products term where every term is a minterm

20
Q

Decoder

A

A high level building block commonly used in digital circuits. A decoder decodes inputs n-binary number by setting exactly one of the decodes 2^n outputs to 1. If e = 0 -> all outputs = 0
Inputs: i0 i1 (selectors, decides which output should be 1) e (enabler, 1if using decoder.)
Outputs: one output, selected by the selectors, is 1, else they are all 0’s

21
Q

Encoder

A

The opposite functionality of a decoder has n number of inputs and log^2(n) number of outputs. Exactly 1 input is assumed to be 1 at a time. Priority decoder deal with more then 1 input being 1 at a time

22
Q

Muxes

A

A m X 1 mux has m data inputs and 1 data output and allows only one input to pass through to that input.