NPTEL Computer Architecture And Organization Assignment 7 Answer

We Discuss About That NPTEL Computer Architecture And Organization Assignment 7 Answer

NPTEL Computer Architecture And Organization Assignment 7 Answer – Here All The Questions and Answers Provided to Help All The Students and NPTEL Candidate as a Reference Purpose, It is Mandetory to Submit Your Weekly Assignment By Your Own Understand Level.

Are you looking for the Assignment Answers to NPTEL Computer Architecture And Organization Assignment 7 Answer? If Yes You are in Our Great Place to Getting Your Solution, This Post Should be help you with the Assignment answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL Computer Architecture And Organization Assignment 7 Answer”

NPTEL Computer Architecture And Organization Assignment

Next Week Assignment Answers

CHECK HERE OTHERS NPTEL ASSIGNMENTS ANSWERS 

BELOW YOU CAN GET YOUR NPTEL Computer Architecture And Organization Assignment 7 Answer 2022? :

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW

1 point

Suppose A = 24 – 30, what will be the value of A using 6-bit 2’s complement arithmetic?

 a. 111010

 b. 110010

 c. 111011

 d. 111001

Ans  – A

1 point

How many basic gates (AND, OR, NOT) are required to construct a half-adder? What is the delay of a half-adder, considering the delay of each basic gate is 1?

 a. 4, 2

 b. 5, 2

 c. 4, 3

 d. 6, 3

Ans  – B

1 point

Suppose we are using 4-bit carry lookahead adder modules to build a 64-bit adder with two-level carry lookahead, with ripple carry between the modules. If the delay of a basic gate (AND, OR, NOT) is 2 nanoseconds, what will be the worst-case delay of the 64-bit adder?

 a. 26 nsec

 b. 24 nsec

 c. 25 nsec

 d. None of these

Ans  – B

1 point

What is/are the advantage(s) of the carry look-ahead adder over ripple carry adder for adding two n-bit numbers?

 a. The time for addition becomes linear in n and not exponential.

 b. The time for addition is independent of n.

 c. The hardware requirement is less.

 d. It can be easily extended to larger values of n.

Ans  – A

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW

1 point

Suppose we multiply (11) x (12) using shift-and-add multiplication, where each number is represented in 5 bits. What will be the values of C (Carry Out from adder), A (temporary register), and Q (multiplier) after the third step?

 a. 0, 10101, 11100

 b. 0, 00101, 10001

 c. 0, 01011, 00011

 d. 0, 00000, 00011

Ans  – B

1 point

Why does the MIPS32 architecture does not have any status flags?

 a. It helps in efficient pipeline implementation.

 b. A dedicated register is used to store the status flags.

 c. The status flags are embedded in the instruction encoding.

 d. None of these.

Ans  – A

1 point

What will be the Booth encoding for the 12-bit binary number 0111 1100 0110?

 a. -1000 0-100 +10-10

 b. -1000 0+100 -10+10

 c. +1000 0-100 +10-10

 d. +1000 0+100 -10+10

Ans  – D

1 point

Suppose we add six n-bit numbers using carry save adder (CSA) blocks. The hardware requirement will be:

 a. 6 CSA blocks and 1 parallel adder

 b. 5 CSA blocks and 1 parallel adder

 c. 5 CSA blocks

 d. 4 CSA blocks and 1 parallel adder

Ans  – D

1 point

When two 8-bit numbers (A7 A6 … A0) and (B7 B6 … B0) in 2’s complement representation (with A0 and B0 as the least significant bits) are added using ripple carry adder, the sum bits obtained are (S7 S6 … S0), and the carry bits are (C7 C6 … C0). An overflow is said to have occurred if:

 a. The carry bit C7 is 1

 b. All the carry bits (C7, C6 … C0) are 1

 c. A7.B7.S7’ + A7’.B7’.S7 is 1

 d. A0.B0.S0’ + A0’.B0’.S0 is 1

Ans  – C

Answers will be Uploaded Shortly and it will be Notified on Telegram, So JOIN NOW

1 point

Which of the following statements are true?

 a. Non-restoring division is faster than restoring division.

 b. The correction step that is required in restoring division is eliminated in non-restoring division.

 c. For n-bit divisor and n-bit dividend, the number of restoring additions will be n/2 on the average.

 d. The data paths required for shift-and-add multiplication and restoring division are somewhat similar.

 e. All of these.

Ans  – D

Yhaa You have done it but next? if YOU Want to your Others NPTEL Computer Architecture And Organization Assignment 7 Answer  Then Follow US HERE and Join Telegram.