Question

Lab 6 Conditional Branching In this lab you will implement an algorithm for word-size signed integer division. Given 4 word-size values N (numerator), D (denominator), Q (quotient), and R (remainder). Signed integer division has 4 cases: N/D = Q r R, -N/D = -Q r -R, N/-D = -Q r R, -N/-D = Q r R The above can be implemented as follows: 1. Initialize sign case = 0 (positive N, positive D). 2. If N < 0 3. then: apply 2's complement to make it positive 4. increment sign case. 5. endif 6. If D < 0 7. then: apply 2's complement to make it positive 8. sign case = sign case + 2 9. endif 10. while (N ? D) 11. N = N - D 12. Increment Q 13. endw 14. R = N 15. if case = 1 16. then: apply 2's complement Q and R 17. elseif case = 2 18. then: complement Q 19. endif A word is made up of 2 bytes. To apply 2's complement to a word, complement each byte separately, then add 1. Create a special check for D = 0. If D = 0 then you can skip the while and write Q = 0, N = 0 to represent NaN (Not-a-Number). A similar check can be done for D = 1 for faster/efficient programming. Recommendation: Start by implementing the above algorithm for integer byte. Submitting an integer byte implementation of the assignment constitutes 85% effort.

          Lab 6
Conditional Branching

In this lab you will implement an algorithm for word-size signed integer division.

Given 4 word-size values N (numerator), D (denominator), Q (quotient), and R (remainder). Signed
integer division has 4 cases:
N/D = Q r R, -N/D = -Q r -R, N/-D = -Q r R, -N/-D = Q r R

The above can be implemented as follows:

1. Initialize sign case = 0 (positive N, positive D).
2. If N < 0
3. then: apply 2's complement to make it positive
4. increment sign case.
5. endif
6. If D < 0
7. then: apply 2's complement to make it positive
8. sign case = sign case + 2
9. endif
10. while (N ? D)
11. N = N - D
12. Increment Q
13. endw
14. R = N
15. if case = 1
16. then: apply 2's complement Q and R
17. elseif case = 2
18. then: complement Q
19. endif

A word is made up of 2 bytes. To apply 2's complement to a word, complement each byte separately, then add 1.

Create a special check for D = 0. If D = 0 then you can skip the while and write Q = 0, N = 0 to represent NaN (Not-a-Number). A similar check can be done for D = 1 for faster/efficient programming.

Recommendation: Start by implementing the above algorithm for integer byte. Submitting an integer byte implementation of the assignment constitutes 85% effort.

Lab 6
Conditional Branching

In this lab you will implement an algorithm for word-size signed integer division.

Given 4 word-size values N (numerator), D (denominator), Q (quotient), and R (remainder). Signed
integer division has 4 cases:
N/D = Q r R, -N/D = -Q r -R, N/-D = -Q r R, -N/-D = Q r R

The above can be implemented as follows:

1. Initialize sign case = 0 (positive N, positive D).
2. If N < 0
3. then: apply 2's complement to make it positive
4. increment sign case.
5. endif
6. If D < 0
7. then: apply 2's complement to make it positive
8. sign case = sign case + 2
9. endif
10. while (N ? D)
11. N = N - D
12. Increment Q
13. endw
14. R = N
15. if case = 1
16. then: apply 2's complement Q and R
17. elseif case = 2
18. then: complement Q
19. endif

A word is made up of 2 bytes. To apply 2's complement to a word, complement each byte separately, then add 1.

Create a special check for D = 0. If D = 0 then you can skip the while and write Q = 0, N = 0 to represent NaN (Not-a-Number). A similar check can be done for D = 1 for faster/efficient programming.

Recommendation: Start by implementing the above algorithm for integer byte. Submitting an integer byte implementation of the assignment constitutes 85% effort.

Added by Maria R.

Question

Please give Ace some feedback