Computer Architecture Week 2 NPTEL Assignment Answers 2025

Need help with this week’s assignment? Get detailed and trusted solutions for Computer Architecture 2 NPTEL Assignment Answers. Our expert-curated answers help you solve your assignments faster while deepening your conceptual clarity.

✅ Subject: Computer Architecture
📅 Week: 2
🎯 Session: NPTEL 2025 July-October
🔗 Course Link: Click Here
🔍 Reliability: Verified and expert-reviewed answers
📌 Trusted By: 5000+ Students

For complete and in-depth solutions to all weekly assignments, check out 👉 NPTEL Computer Architecture Week 2 NPTEL Assignment Answers

🚀 Stay ahead in your NPTEL journey with fresh, updated solutions every week!

NPTEL Computer Architecture Week 2 Assignment Answers 2025

1. Which of the following is true according to the Associative Law?

  • A . (B + C) = (A . B) + C
  • (A + B) + C = A + (B + C)
  • A + A = A
  • A + A’ = 1
Answer : See Answers 

2. Which of the following Boolean expressions illustrates the Consensus Theorem?

  • AB + A’C = (A + C)(B + C)
  • AB + A’C = AB + A’C
  • AB + A’C + BC = AB + A’C
  • AB + A’B = A + B
Answer : See Answers 

3. Which of the following numbers is a valid octal number?

  • 728
  • 180
  • 345
  • 889
Answer : See Answers 

4. What is the hexadecimal equivalent of the binary number 10101111?

  • AF
  • 9F
  • A7
  • B1
Answer : See Answers 

5. What is the 8-bit sign-magnitude representation of -13?

  • 11110011
  • 10001101
  • 11101101
  • 10001001
Answer : See Answers 

6. In signed 4-bit binary addition, which of the following indicates an overflow?

  • Adding two negative numbers results in a positive
  • Adding a positive and negative number
  • Adding two positive numbers gives a positive result
  • MSB is 0 after addition
Answer : See Answers 

7. Which of the following components are a part of the IEEE 754 single-precision floating-point format?

  • Sign bit, 8-bit exponent, 23-bit mantissa
  • Sign bit, 16-bit exponent, 16-bit fraction
  • Sign bit, 4-bit exponent, 27-bit mantissa
  • Sign bit, 10-bit exponent, 22-bit mantissa
Answer : See Answers 

8. Which of the following statements about special floating-point values is correct in the IEEE 754 format? Choose the most appropriate answer.

  • 1 / 0 = ∞,  0 / 0 = NaN
  • NaN + 5 = NaN
  • -1 / 0 = -∞,  sin⁻¹(5) = NaN
  • All of the above
Answer :

9. Which of the following statements is true about the UTF-8 encoding?

  • It uses a fixed 8-bit format for every character
  • It can represent only English letters
  • It uses the same byte values as ASCII for standard English characters
  • It uses 32 bits for each character
Answer :

10. Which of the following statements is true about the ASCII character encoding scheme?

  • ASCII supports 256 characters using 8-bit encoding
  • ASCII uses 7 bits to represent each character and includes control characters like backspace and line feed
  • ASCII includes only printable characters and excludes control operations
  • ASCII uses variable-length encoding for international characters
Answer : See Answers 

NPTEL Computer Architecture Week 2 Assignment Answers 2024

1. What is the smallest positive denormal number in the IEEE 754 standard?

  • a) 2⁻¹²⁶
  • b) 2⁻¹²⁷
  • c) 2⁻¹⁴⁹ ✅
  • d) 2⁻¹⁵⁰

Answer: c) 2⁻¹⁴⁹
Explanation: In IEEE 754 single-precision (32-bit), denormal numbers fill the gap between 0 and the smallest normal number (2⁻¹²⁶). The smallest positive denormal is 2⁻¹⁴⁹ because it assumes an exponent of -126 and the smallest fraction (mantissa) of 0.000…01 (i.e., 2⁻²³).


2. Consider the following assembly code in the SimpleRISC ISA.

asmCopyEditmovh r0, 0xFB12  
addu r0, r0, 0xCDEF
  • a) 0xCDEFFB12
  • b) 0xFB12CDEF ✅
  • c) 0x0001C901
  • d) 0xFBCD12EF

Answer: b) 0xFB12CDEF
Explanation:

  • movh r0, 0xFB12 moves 0xFB12 to the high 16 bits of r0, so r0 = 0xFB120000.
  • addu r0, r0, 0xCDEF adds 0xCDEF to the current r0.
    So, final result = 0xFB120000 + 0x0000CDEF = 0xFB12CDEF

3. What are the contents of r2 and r4 after executing this code?

asmCopyEditmov r1, 10  
mov r3, 5  
st r1, [sp]  
add r4, r1, r3  
ld r2, [sp]
  • a) r2 = 10, r4 = 15 ✅
  • b) r2 = 15, r4 = 10
  • c) r2 = 10, r4 = 10
  • d) r2 = 15, r4 = 15

Answer: a) r2 = 10, r4 = 15
Explanation:

  • st r1, [sp] stores 10 to memory
  • add r4, r1, r3 → r4 = 10 + 5 = 15
  • ld r2, [sp] → r2 = value from memory = 10

4. What is the content of r2 after executing these instructions?

asmCopyEditmov r1, 20  
lsl r2, r1, 2
  • a) 80 ✅
  • b) 10
  • c) 40
  • d) 5

Answer: a) 80
Explanation:

  • lsl is logical shift left. r2 = r1 << 2 = 20 × 2² = 80

5. The SimpleRISC ISA has ________ registers.

  • a) 15
  • b) 16 ✅
  • c) 17
  • d) None of the options

Answer: b) 16
Explanation: SimpleRISC has 16 general-purpose registers (r0 to r15).


6. Which of the following is not a shift instruction in the SimpleRisc ISA?

  • a) lsl
  • b) asr
  • c) asl ✅
  • d) lsr

Answer: c) asl
Explanation:

  • lsl, lsr, and asr are valid shift instructions.
  • asl is not a valid instruction in SimpleRISC.

7. The bgt instruction bases its outcome on the value of ____________ flag(s).

  • a) Both E and GT
  • b) GT ✅
  • c) E
  • d) None of the options

Answer: b) GT
Explanation:

  • bgt (branch if greater than) checks the GT flag (Greater Than).

8. A fixed-point number has a fixed number of digits ___________.

  • a) After the decimal point ✅
  • b) Before the decimal point
  • c) Both before and after the decimal point
  • d) None of the options

Answer: a) After the decimal point
Explanation:

  • Fixed-point representation typically keeps a fixed number of digits after the decimal to handle fractions.

9. UTF-32 uses __ bytes for every character.

  • a) 2
  • b) 4 ✅
  • c) 6
  • d) 8

Answer: b) 4
Explanation:

  • UTF-32 encodes each Unicode character using exactly 4 bytes (32 bits).

10. How many bits are used for the exponent in IEEE 754 double precision?

  • a) 11 ✅
  • b) 8
  • c) 52
  • d) 10

Answer: a) 11
Explanation:

  • IEEE 754 double precision format:
    • 1 sign bit
    • 11 exponent bits
    • 52 mantissa (fraction) bits

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top