# NPTEL Computer Architecture Week 7 Assignment Answers 2024

By Sanket

## NPTEL Computer Architecture Week 7 Assignment Answers 2024

1. The result of the following addition is _________.
(1101.101)2 + (1011.11)2

• (11001.111)2
• (11001.011)2
• (11000.011)2
• (1001.011)2
`Answer :- For Answers Click Here`

2. The expression for Cout of a full adder is ___________.

• Cout = a.b
• Cout = a.b + a.cin + b.cin
• Cout = a.b.cin
• Cout = a’.b + a’. Cin + b.cin
`Answer :- For Answers Click Here`

3. Consider a function f(n) = 212n55 + 24n28 + 32. What is its asymptotic time complexity?

• f(n) = O(n28)
• f(n) = O(n55)
• f(n) = O(n83)
• f(n) = O(1)
`Answer :- For Answers Click Here`

4. The total time complexity of the carry-select adder for performing an n-bit addition is ___________.

• O(n)
• O(sqrt(n))
• O(log n)
• O(n log n)
`Answer :- `

5. In a Booth multiplier, if the bit pair consisting of the current and the previous multiplier bit is (0,1) then we need to __________.

• Subtract the multiplicand
• Add the multiplicand
• Subtract the multiplier
• Do nothing
`Answer :- `

6. Consider a carry lookahead adder, let the inputs be Ai = 1, Bi = 0 and the carry input Cin = 1. What are the values of gi, pi and Cout?

• gi = 1, pi = 1 and Cout = 0
• gi = 0, pi = 0 and Cout = 0
• gi = 0, pi = 1 and Cout = 1
• gi = 1, pi = 1 and Cout = 1
`Answer :- For Answers Click Here`

7. In a ripple carry adder circuit for adding two 8-bit numbers, we need to have _ full adders and _ half adder(s)?

• 7, 1
• 0, 8
• 2, 6
• 6, 2
`Answer :- `

8. The Wallace tree multiplier uses a ______________ in the last stage.

• Ripple Carry Adder
• Carry Select Adder
• Carry Save Adder
`Answer :- `

9. How many levels are there in a Wallace tree multiplier?

• log3/2(n)
• n/2
• log3/2(n) + 1
• n2
`Answer :- `

10. Select the correct statement/s. Choose the most appropriate option.

• The asymptotic time complexity of the Wallace tree multiplier is O(log(n)).
• The Booth multiplier takes advantage of a continuous run of 1s to speed up the multiplication process.
• In a carry select adder, sqrt(n) is the optimal block size for adding two n-bit numbers.
• All of the options
`Answer :- For Answers Click Here`