Lecture 1 - Binary and Boolean Algebra Flashcards

Understand Binary and Boolean Algebra

1
Q

Define the term “Analog”

A

Infinite number of increments and/or possibilities

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

Define the term “Digital”

A

Means that there is a limited set of values by which something can be represented

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

What does 0 represent in the binary number system?

A

ON

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

What does 1 represent in the binary number system?

A

OFF

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

MSB

A

Refers to the outermost left bit and stands for “Most Significant Bit”

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

LSB

A

Refers to the outermost right bit and stands for “Least Significant Bit”

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

How is the binary number system different from the decimal number system?

A

Where the decimal number system has 10 symbols to be represented with (0 to 9) the binary number system only has two (0 to 1)

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

Nibble

A

Group of 4 bits

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

Byte

A

Group of 8 bits

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

Word

A

Another group of bits where the length is processor dependant (depends on what processor we’re looking at)

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

How many numbers can be represented in a n-bit word?

A

The number of states which can be represented are: 2^n ; (0 - 2^n)

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

What formula is used to calculate the amount of bits needed to represent a number?

A

Since the highest number to be represented is found using the formula: y = 2^n - 1, therefore to find the number of bits to represent it: n = log[2] (y + 1) ; log base 2

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

What do the 0s and 1s represent in a digital signal?

A

They represent a range of voltages (since the signals are waves, as long as the voltage is within a range it will either be on or off)

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

Grey Zone

A

Interpretable region in a digital signal graph which is outside of the ON voltage and OFF voltage range (sandwiched in between)

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

Accuracy (Analog vs. Digital)

A

Analog: 0.1% is considered a very good accuracy
Digital: Accuracy is directly proportional to the amount of circuitry added

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

Long Term Storage (Analog vs. Digital)

A

Analog: Store data as voltage on a capacitor (short term for an approximate maximum of 30 mins)
Digital: Stores data in memory (long term can last up to years)

17
Q

Speed (Analog vs. Digital)

A

Most common use of analog or digital
Analog: Fastest circuits, high-frequency, etc

18
Q

Define “Analog Signals”

A

Smooth, continuous waves that can have any value within a range, like turning up the volume smoothly.

19
Q

Define “Digital Signals”

A

Step-like signals that are either on or off, high or low, representing information using distinct levels, like flipping a light switch.

20
Q

What is Boolean Algebra

A

Two-value algebra; values of either 0 or 1

21
Q

AND

A

(ab) = X is 1 if both a and b are 1

22
Q

OR

A

(a + b) = X is 1 if a or b or both are 1

23
Q

XOR

A

X is 1 if exactly one of a or b are 1 (not both; essentially OR with an extra condition)

24
Q

NAND

A

X is 0 if both a and b are 1

25
Q

NOR

A

X is 0 if either a or b or both are 1

26
Q

X-NOR

A

X is 0 if exactly one of a or b are 1

27
Q

Absorption Laws (S1)

A

XY + X = X

28
Q

Dual Absorption Laws (S2)

A

(X + Y) X = X

29
Q

Basic Laws (B1) and (B2) and their Dual Form (B3) and (B4)

A

X + 0 = X (B1)
X + 1 = 1 (B2)

X (1) = X (B3)
X (0) = 0 (B4)

30
Q

Idempotent (I1)

A

A variable is unchanged by operating with itself
X + X = X

31
Q

Dual Idempotent (I2)

A

X (X) = X

32
Q

Commutative Laws (C1)

A

X + Y = Y + X

33
Q

Dual Commutative Laws (C2)

A

(X) (Y) = (Y) (X)

34
Q

Associative Laws (A1)

A

X + (Y + Z) = (X + Y) + Z

35
Q

Dual Associative Laws (A2)

A

(X) (YZ) = (XY) (Z)

36
Q

Distributive Laws (D1)

A

(X + Y) (Z) = (XZ) + (YZ)

37
Q

Dual Distributive Laws (D2)

A

(XY) + Z = (X + Z) (Y + Z)