Wasnt sure if this should go under computer science or EE as i am taking digital logic for my cs curriculum if you believe this should have been posted under EE please comment saying so, so that i may repost it, thanks

1)

Assume that for a carry lookahead adder the propagate bits and generate bits have been computed as p3p2p1p0 = 0111, g3g2g1g0 = 0001, and the carry-in bit is c0 = 0. Determine the carry bits c4c3c2c1:

1110

None of the other three

0111

1111

2)

Assume that for a carry lookahead adder the propagate bits and generate bits have been computed as p3p2p1p0 = 0111, g3g2g1g0 = 0001, and the carry-in bit is c0 = 0. Determine the sum bits s3s2s1s0:

0101

0001

None of the other three

1000

3)

How many different pairs of x3x2x1x0 and y3y2y1y0 are possible for the given values of p3p2p1p0 = 0111 and g3g2g1g0 = 0001?

6

4

None of the other three

2

4)

Assume x3x2x1x0 >= y3y2y1y0. How many different pairs of x3x2x1x0 and y3y2y1y0 are possible for the given values of p3p2p1p0 = 0111 and g3g2g1g0 = 0001?

3

None of the other three

2

1

5)

Consider the 64-bit adders constructed by ripple-carry connection of 1-bit full adders. Determine the gate delay of the last carry out bit c64:

128d

160d

None of the other three

96d

6)

Consider the 64-bit adders constructed by ripple-carry connection of 1-bit full adders. Determine the AND/OR gate complexity:

256 AND/OR

144 AND/OR

192 AND/OR

None of the other three

7)

Consider the 64-bit adders constructed by ripple-carry connection of 1-bit full adders. Determine the XOR gate complexity:

64 XOR

80 XOR

None of the other three

48 XOR