Are you looking for Computer Architecture Nptel Week 7 Assignment Answers 2024 ? You’ve come to the right place! Access the latest and most accurate solutions for your Week 7 assignment in Computer Architecture course.
The result of the following addition is __. (1101.101)₂ + (1011.11)₂ A) (11001.111)₂ B) (11001.011)₂ C) (11000.011)₂ D) (1001.011)₂
Answer: B) (11001.011)₂
The expression for Cout of a full adder is __. A) Cout = a.b B) Cout = a.b + a.cin + b.cin C) Cout = a.b.cin D) Cout = a’.b + a’. Cin + b.cin
Answer: B) Cout = a.b + a.cin + b.cin
Consider a function f(n) = 212n^55 + 24n^28 + 32. What is its asymptotic time complexity? A) f(n) = O(n^28) B) f(n) = O(n^55) C) f(n) = O(n^83) D) f(n) = O(1)
Answer: B) f(n) = O(n^55)
The total time complexity of the carry-select adder for performing an n-bit addition is __. A) O(n) B) O(sqrt(n)) C) O(log n) D) O(n log n)
Answer: B) O(sqrt(n))
In a Booth multiplier, if the bit pair consisting of the current and the previous multiplier bit is (0,1) then we need to _. A) Subtract the multiplicand B) Add the multiplicand C) Subtract the multiplier D) Do nothing
Answer: B) Add the multiplicand
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? A) gi = 1, pi = 1 and Cout = 0 B) gi = 0, pi = 0 and Cout = 0 C) gi = 0, pi = 1 and Cout = 1 D) gi = 1, pi = 1 and Cout = 1
Answer: C) gi = 0, pi = 1 and Cout = 1
In a ripple carry adder circuit for adding two 8-bit numbers, we need to have _ full adders and _ half adder(s)? A) 7, 1 B) 0, 8 C) 2, 6 D) 6, 2
Answer: A) 7, 1
The Wallace tree multiplier uses a _ in the last stage. A) Ripple Carry Adder B) Carry Select Adder C) Carry Lookahead Adder D) Carry Save Adder
Answer: D) Carry Save Adder
How many levels are there in a Wallace tree multiplier? A) log3/2(n) B) n/2 C) log3/2(n) + 1 D) n^2
Answer: C) log3/2(n) + 1
Select the correct statement/s. Choose the most appropriate option. A) The asymptotic time complexity of the Wallace tree multiplier is O(log(n)). B) The Booth multiplier takes advantage of a continuous run of 1s to speed up the multiplication process. C) In a carry select adder, sqrt(n) is the optimal block size for adding two n-bit numbers. D) All of the options
Answer: D) All of the options
These are Computer Architecture Week 7 Assignment Solutions
