Computer Architecture and Organization - Complement Division for signed numbers 2, Study notes of Computer Architecture and Organization

Download Computer Architecture and Organization - Complement Division for signed numbers 2 and more Study notes Computer Architecture and Organization in PDF only on Docsity!

Unit-2: 2’s Complement Division

for signed numbers Contd.,

Recap

Session Objectives & Teaching Learning

Material

Session Plan

Differences between Singed and Unsigned

division

Division Algorithm for signed numbers

Interpretation of an example to an

algorithm

Example’s

Assignment

References

OutLine

Session Objectives

◦ To provide knowledge on Signed Divisions

◦

To teach procedure for binary Division for signed

numbers.

◦ To enable the students to perform binary division

using binary division algorithm for signed

numbers

◦ To provide fundamentals for the development of

simulator for division algorithms

Teaching Learning Material

◦ LCD, White board Marker, Presentation slides

Objectives & Teaching

Learning Material

Session Plan

Time

(in min)

Content

Learning Aid

and

Methodology

Faculty

Approach

Typical

Student

Activity

Skill and

Competency

Developed

Re-Cap

Quiz

Presentation

Questions

Organizes

Answers

Identifies

Knowledge

Evaluation

05 Binary Division

Explains Presentations Listens Knowledge

10 Algorithm Explains

Presentatio

n

Observes

Analytical

Interpretation of

an example to

algorithm

Explains

Presentatio

n

Observes

Analytical

15 Examples

Presentati

on

Facilitates Solves

Analytical

Conclusion and

Summary

Summary Facilitates

Listens

Participates

Comprehensio

n

Divide -7 / 3 using above signed 2's compliment binary

Division

Dividend=-7  1001 Q Divisor = 3  0011 M

A Q Action

Count

1 0 0 1 Initial

1 1 1 1 0 0 1 0 Shift

0 0 1 0 AA+M

Restore

1 1 1 0 0 1 0 0 Shift

AA+M

1 1 1 0 0 1 0 0 Restore

Step

1 1 0 0 1 0 0 0 Shift

AA+M

1 1 1 1 1 0 0 1 Set Q

0

1 1 1 1 0 0 1 0 Shift

0 0 1 0 AA+M

1 1 1 1 0 0 1 0 Restore 0

2. Shift A, Q left 1 bit

position.

3. If M and A have the same

signs , Perform AA-M ;

oterwise ,A A+M.

4. The above operation is

successful if the sign of A is

the same before and after the

operation.

4.a. If the operation is

successful or (A=0 AND

Q= 0) ,then Set Q

0

4.b. If the operation is

unsuccessful and (A!=

or Q!=0),then Q

0

 0 and

restore the privious

value of A.

6. The reminder is in A. The

signs of the divisor and

dividend were the same, Then

the quotient is in Q; Otherwise,

the correct quotient is the

two's complement of Q.

-7/ -

A Q`

1111 1001 Initial Value

1111 0010 Shift

0010 Subtract

1111 0010 Restore

1110 0100 Shift

0001 Subtract

1110 0100 Restore

1100 1000 Shift

1111 Subtract

1111 1001 Set Q

0

= 1

1111 0010 Shift

0010 Subtract

Divide the following using 2’s Complement

Division Algorithm for signed numbers

-11 / 13

11 / -

-11 / -

Examples

Develop a Simulator to perform Division

algorithm using 2’s complement division

algorithms for unsigned numbers that

display the step by step result.

Programming Assignment

Text Book

William Stallings “Computer Organization

and architecture” Prentice Hall, 7th edition,

References