2. Write a MIPS program that will handle calculating minifloat addition for two numbers using the rules discussed in class and storing each of the parts as a binary integer. To do this, each 'minifloat number will need to be represented (I suggest hard coded) as one register for the sign, one for the exponent part, one for the 'significand' (which you then convert to the fraction part). Hard coding means here that you don't need to read in the 6 parts as user input, just have something like li $s0, 0 li $1, 12 li $s2, 5 which is equivalent to a minifloat of 0 1101 101 = 1.101 * 2^(12-7) = 1.101*2^5 This means your program will be work with at least 6 registers as variables. For testing, show that your program can correctly calculate the Lab 5 X+Y and A+B and then one other example of your choosing. Don't worry about special cases of 0 0000 000 or 1 1111 111 or similar, but your program should detect overflow. This will involve a lot of (in your head) jumping back and forth between decimal and binary potentially: that's the point. Note: This is an obviously contrived example, the intent is to force you to think about the algorithm, not to make software that anyone would ever want to use.

2. Write a MIPS program that will handle calculating minifloat addition for two numbers using the rules discussed in class and storing each of the parts as a binary integer. To do this, each 'minifloat number will need to be represented (I suggest hard coded) as one register for the sign, one for the exponent part, one for the 'significand' (which you then convert to the fraction part). Hard coding means here that you don't need to read in the 6 parts as user input, just have something like li $s0, 0 li $1, 12 li $s2, 5 which is equivalent to a minifloat of 0 1101 101 = 1.101 * 2^(12-7) = 1.101*2^5 This means your program will be work with at least 6 registers as variables. For testing, show that your program can correctly calculate the Lab 5 X+Y and A+B and then one other example of your choosing. Don't worry about special cases of 0 0000 000 or 1 1111 111 or similar, but your program should detect overflow. This will involve a lot of (in your head) jumping back and forth between decimal and binary potentially: that's the point. Note: This is an obviously contrived example, the intent is to force you to think about the algorithm, not to make software that anyone would ever want to use.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Write a C++ program: to iteratively compute Fibonacci numbers (named after an Italian mathematician). Some Fibonacci numbers are 1,1,2,3,5,8,... where the next number is found by summing the preceding two numbers. Your program is not assured of recieving good data, thus if -2 is recieved as the number of numbers, then an error should be reported. Try n = 5, 7, 10, -3
Write a program that converts an ASCII text string from memory into all lowercase and stores the output to memory. The input string can contain uppercase and lowercase letters as well as spaces, punctuation (period, comma, question mark, exclamation point), and decimal digits. The input string will be null-terminated (that is, end with a 0 byte) and the output string is also to be null-terminated. (Observe: a 0 byte is different than the ASCII code for decimal digit 0 , which is 0x30.) Example: Convert the string "IN 2023, faLL stARTs on September 23." to "in 2023, fall starts on september 23.".
I need help in this practice problem of C (notC++ or C#) without using strings or arrays. The Union Flag or the Union Jack is the national flag of the United Kingdom of Great Britain and Northern Ireland. Create a program that will create the flag using ASCII given an integer input for the size (always odd): x o o o o o o o o o x x * * * x x * * * x x * * * x x * * * x x * * * * * * * * * x x * * * x x * * * x x * * * x x * * *x x o o o o o o o o o x
Write a program that reads an arbitrary number of integers that are in the range -25 to 25 inclusive and counts how many occurences of each are entered. Indicate the end of the input by a value outside of the range. After all input has been processed, print all of the values (with the number of occurences) that were entered one or more times.
Write a C++ program where the user inputs two positive integers, A and B, where 5≤ A ≤10 and 20≤ B ≤30. (use user defined functions) A function to output AB (where A is multiplied by itself B times) do not use the built in “pow” function, use your own function. A function that returns the area of a rectangle of height A and width B. A function that returns the sum of odd numbers between A and B. A function to calculate AB recursively. Knowing that AB = AB-1 * A with base case A0 =1
Write a code in C++: Write a program to factor a polynomial of the form x² + bx + c, where b and c are integers AND also modify the program so that it can also factor polynomials of the form ax2 + bx + c , where a, b, and c are integers. Note that the polynomial _ - 2x² - 3x + 2_ can be factored as: _ - 2x² - 3x + 2 = (-2x + 1)(x + 2) = - (2x - 1)(x + 2)_.
Do asap for me Reverse bits of a given 32 bits unsigned integer. Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer's internal binary representation is the same, whether it is signed or unsigned. In Java, the compiler represents the signed integers using 2's complement notation. Therefore, in Example 2 above, the input represents the signed integer -3 and the output represents the signed integer -1073741825. Code in Java A brief explanation of how and why your code works and how it relates to the concepts learned (for example, it uses bitwise operation, stack, or takes into account a word size.. ... .... O
Please use C++ In this lab, you need to write a program which, given a seven digit binary input given below, it will check to see if there is a single bit error using the Hamming Code method discussed in lab. For a sample of Hamming Code, the input: 1110101 will reveal that ‘110’ is the location of the error (meaning the sixth slot in the input), so the corrected number would be 1010101, and the actual message transmitted, would be 1011, which is 11 in decimal. You can use this example to test your program to ensure it’s working correctly. Create a program which can, given a 7-bit long input, written in Hamming Code style, do the three following tasks, displaying the results as output. (1) Determine if there’s an incorrect bit, and if so, where it is. (2) Display what the CORRECT code should look like (if it needs to be corrected.) (3) Display the decimal form of the message that was sent, after any needed correction. Remember, when using Hamming…
Write a C++ program that asks the user to enter a positive integer n and then that reads n user input integers and finally prints the message The numbers you entered are in increasing order if they are in increasing order or the message The numbers you entered are NOT in increasing order if they are not. See the remark below. Remark:- Remember given the numbers a1, az, as, ..., an; we say they are in increasing order if ay 5 a, 5 a,≤ .... ≤ an. Moreover remember that if you have only one number from the user input then the number automatically is in increasing order.(CAN ONLY USE WHILE LOOPS)
Solve in python: When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This adjustment can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by dividing all values by the largest value. The input begins with an integer indicating the number of floating-point values that follow. Output each floating-point value with two digits after the decimal point, which can be achieved as follows: print(f'{your_value:.2f}') Ex: If the input is: 5 30.0 50.0 10.0 100.0 65.0 the output is: 0.30 0.50 0.10 1.00 0.65 The 5 indicates that there are five floating-point values in the list, namely 30.0, 50.0, 10.0, 100.0, and 65.0. 100.0 is the largest value in the list, so each value is divided by 100.0.
Implement the quadratic_formula() function. The function takes 3 arguments, a, b, and c, and computes the two results of the quadratic formula: x1=−b+b2−4ac2a x2=−b−b2−4ac2a The quadratic_formula() function returns the tuple (x1, x2). Ex: When a = 1, b = -5, and c = 6, quadratic_formula() returns (3, 2). Code provided in main.py reads a single input line containing values for a, b, and c, separated by spaces. Each input is converted to a float and passed to the quadratic_formula() function. Ex: If the input is: 2 -3 -77 the output is: Solutions to 2x^2 + -3x + -77 = 0 x1 = 7 x2 = -5.50 code: # TODO: Import math module def quadratic_formula(a, b, c):# TODO: Compute the quadratic formula results in variables x1 and x2return (x1, x2) def print_number(number, prefix_str):if float(int(number)) == number:print("{}{:.0f}".format(prefix_str, number))else:print("{}{:.2f}".format(prefix_str, number)) if __name__ == "__main__":input_line = input()split_line = input_line.split(" ")a =…
Write a C program that reads an integer n ≥ 2 and prints the smallest integer d > 2 such that n is anintegral multiple of d2.If no such d exists, print −1. For example, for n = 49, n = 50, and n =51, your program should print d = 7, d = 5, and d = −1 respectively.