This document discusses different topics in computer architecture including array multiplication, division techniques, and memory placement strategies. It describes how array multipliers perform multiplication using partial products and how division can be done using restoring or non-restoring methods. It also outlines first-fit, best-fit, and worst-fit techniques for placing data in main memory.

1. Architecture
Presented by:shabab Ahmed.
ID:120102031.

2. Array Multiplier
*checking the bits of multiplier one at a time and forming
partial production.
*it is a sequental operation and require sequence of add
and shift micro operation.
*the multiplication of 2 binary number can be done with
one micro-operation by means of combinational circuit.

3. Array Multiplier(cont.)
2-bit by 2-bit array
multiplication.
Multiplicand-> b1 ,b0
Multiplier->a1 ,a0
Product->c3 ,c2 ,c1 ,c0

4. Division
This section describes how to divide two integars.
Dividend(Q) and a Divisor(M) and reminder(A)
*Re-storing.
*Non-restoring.

5. Re-storing
*left-shift operation.
*A-M operation.
*if the sign value 1 then put 0 on LSB of dividend.
*if the sign value 0 then put 1 on LSB of dividend.
*if the MSB of reminder is 0 then restore previous value.
*if the MSB of reminder is 1 then put previous value.
*the step of operation depend on bit number of that
binary number.

6. Re-storing

7. Placement Strategies
Placement strategies decide where to place an incoming
data in the main mamory.
*First-fit technique.
*Best-fit technique.
*Worst-fit technique.

8. Placement Strategies(cont.)

9. Thank you