Project description Write assembly language programs to perform each of the foll
ID: 3700313 • Letter: P
Question
Project description Write assembly language programs to perform each of the following calculations. In your programs, ignore overflow (i.e., assume that your operand values will not produce an overflow. Add long word. Add two 64-bit unsigned values (e.g., C ? A + B) Negate long word: Negate a 64-bit value by replacing the value by its two's complement . . .Subtract long word: Subtract a 64-bit value from another 64-bit value (e.g., C+ A B) Multiplv long word: Multiply two 32-bit unsigned values to get a 64-bit result (e.g., C-A* B) Multiply and accumulate: Multiply two 32-bit unsigned values to get a 64-bit result and add this result to a 64-bit destination value (e.g., C C+A B) Dot product of two vectors: Find the dot product of two vectors. Each element of these vectors is a 32-bit unsigned value. The result is a 64-bit value. (e.g. let X=(xo,X1X2, , Y= [yo, y?, ??, , yn], find Z-X.Y-xo* yo + xi* y? + x:" y2+ + xn * yn). Assume that elements of a vector are stored in consecutive memory locations Mano's machine uses 16-bit words. For storing long values occupying more than one word (i.e., 32-bit and 64-bit values), successive words are used. Use a little-endian strategy to organize these bytes. In a little-endian strategy, the memory address of the value is the address of its least-significant word. For example, to store the 64-bit hexadecimal value FF56EE3799880000 at memory address 12, word 0000 will be stored at address 12, word 9988 is stored at address 13, word EE37 is stored at address 14, and word FF56 is stored at address 15.Explanation / Answer
You have submitted too many questions in a single question to answer. Please submit them in another question.
Here is the assembly code for the given problems
Adding words
Negate Word
Substract Words
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.