datapath components Flashcards

1
Q

explain the process of adding in binary

A

binary adders calculate adding binary numbers from left to right. you add the 0s and the 1s and carry the one to the next column if you end up with a two digit number.

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

what is 0111 + 0010?

A

1001

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

what is the difference between an adder and a carry-ripple adder?

A

an adder computes A+B where A & B are N-bit numbers (such as 8-bit numbers). a carry ripple adder mimics adding by hand with carry signals.

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

what is the difference between a half adder and a full adder

A

A full adder adds 3 bits and generates a sum and a carry-out bit. a half adder adds two bits and can generate a sum and a carry out, but only a full adder can be designed starting from a truth table.

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

what do unsigned/signed numbers refer to?

A

signed involve positive and negative integers, but unsigned only includes positive numbers.

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

in singed magnitude representation what do 0 and 1 mean?

A

focus on the very left bit. 0 means positive, 1 means negative

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

explain two’s complement representation

A

invert every bit and add one. for example, 0011 will be 1100 + 1 which is 1101. 1101 now represents a negative number of whatever value it refers to (-5)

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