Skip to content

CSE2134 - Computer Architecture and Organizations

Arithmetic for Computers

Term 151

  • Q4(d) [4]: Multiply the following pair of signed 2's complement numbers: \(A = 010111\), \(B = 101100\).
  • Q6(b) [4]: Write the overflow conditions for addition and subtraction.
  • Q7(c) [2]: Draw a block diagram of ALU.

Term 161

  • Q4(a) [8]: Explain the multiplication algorithm and its hardware.

Term 171

  • Q4(a) [5]: Show the algorithm and hardware diagram for multiplication in a processor.
  • Q4(b) [5]: Divide \((1100)_2\) by \((0101)_2\) using division algorithm.
  • Q4(c) [4]: Show the IEEE 754 binary representation of the number \(-0.75_{ten}\) in single and double precision.

Term 181

  • Q4(a) [6]: Explain multiplication algorithm with an example.
  • Q4(b) [4]: How do you use the adder circuit to subtract two numbers? Explain with example.

Term 191

  • Q1(b) [4]: How to deal overflow for arithmetic operation?
  • Q4(b) [5]: Show the steps to multiply \((00111)_b\) with \((00011)_b\) units multiplication algorithm.
  • Q4(c) [4]: What are the representations of IEEE 754 for single precision and double precision floating point?

Term 211

  • Q5(a) [6]: Design a 4-bit binary multiplier with details implementation.
  • Q5(b) [8]: Briefly analysis the booth multiplication algorithm for the given input: \(16 \times -2\).