Please follow ALL directions!!! Please code in MIPS Assembly Langauge and submit

By
Responsive Centered Red Button

Need Help with this Question or something similar to this? We got you! Just fill out the order form (follow the link below), and your paper will be assigned to an expert to help you ASAP.

Order Form

Please follow ALL directions!!!
Please code in MIPS Assembly Langauge and submit as .asm
files.
In the Settings
menu of SPIM set Bare Machine ON, Allow Pseudo Instructions OFF, Exception
Handler OFF, Delayed Branches ON, Delayed Loads ON and Mapped IO ON
*Write a program to calculate using this boolean formula:
(A and (not B)) or (not (B xor C)).
A, B and C are the bit strings in $5, $6 and $7. Put the final result bit string in register $8.
The initial three instructions are given:
ori $5, $0, 0x9
ori $6, $0, 0x5
ori $7, $0, 0x8
(You cannot use NOT instruction, but you can use NOR).
*Start out a program with these four instructions:
ori $5, $0, 0xbcd
ori $6, $0, 0xfff
ori $7, $0, 0x56
Now by using only shift and register-to-register OR instructions, put the pattern 0xfffbcd56
into register $8. You can use as many registers as you want.
*Suppose register $8 holds value x and register $9 holds value y, write a
program that evaluates the rational function:
(3xy + 7y)/(2x^2 − y)
Leave the quotient in register $10 and remainder in register $11.
The initial two instruction for initializing x and y are given:
addiu $8 , $0 , 32 #x is in $8
addiu $9 , $0 , -45 # y is in $9
To do the computation, DO NOT use 32 or -45 in any of the following instructions.
Use $8 if you
need x and use $9 if you need y so the instructions you write can be
applied to any x or y. The
multiplications and division should be two’s complement multiplication & division.
*Suppose $8 holds value x, evaluate the polynomial:
16x
3 − 3x
2 + 7x + 52
by using Horner’s Method. This is a way of building up values until the final value is reached.
Pick a register, say $7, to act as an accumulator. The accumulator will hold the value at each
step…
• First, put the coefficient of the first term into the accumulator: 16
• Next, multiply that value by x: 16x
• Add the coefficient of the next term: 16x − 3
• Next, multiply that sum by x: 16x
2 − 3x
• Add the coefficient of the next term: 16x
2 − 3x + 7
• Next, multiply that sum by x: 16x
3 − 3x
2 + 7x
• Finally, add the coefficient of the last term: 16x
3 − 3x
2 + 7x + 52
Evaluating the polynomial in this way reduces the number of steps (and the amount of code).
You can initialize x to any value you want at the beginning of your program. The multiplications
should be two’s complement multiplication.

How to create Testimonial Carousel using Bootstrap5

Clients' Reviews about Our Services