1. Write an assembly code for a subroutine implementing signed multiplication with Booth's algorithm. Make sure it works as expected. Compare it with your implementation of sign/magnitude multiplication from the second homework.
Which one is better? From what aspects?
2. There are a large number of algorithms for generating random numbers. The
Linear Congruential Method is one of them, and it has the following form:
In+1 = modm(a In + c)
This generates the next number in the sequence by multiplying the previous number In by a, adding c, and taking modulo m.
Write an assembly code for a subroutine which generates 8 bit random numbers with m=256, a=5, and c=67.