(Solved) : 1 Obiectives Assignment O Understand Implement High Level Language Statements Using Low Le Q29694828 . . .
1. Obiectives of the assignment O Understand how to implement high-level language statements using low-level assembly language instructions. O Understand procedure call mechanisms and resizing of the processor stack during procedure calls, O Gain familiarity with the structure of a stack frame, O Gain familiarity with converting a C language program to assembly code. » Gain experience with the QtSpim simulator 2. The Problem: Determining a New Student ID Number When you arrived at UMass you were given a unique student ID number. You may have wondered how this number was chosen. In this assignment you will develop a MIPs program to replace the mechanism used by UMass to assign student ID numbers. The new approach assigns a number to each letter of the alphabet. The letters in the student name are then converted to numbers and they are summed to form a new ID number. For example, each of the 26 English letters can be assigned a number associated with its place in the alphabet (e.g. ‘a,-1, ‘z’-26, etc). The numbers associated with the letters in the student name can then be summed to determine the final student ID number (e.g. abe ‘a, + ‘b, + ‘?, 1 + 2 + 5-8). Of course, in reality, issues regarding duplicate ID numbers for students would need to be resolved, but for the purposes of this assignment let’s assume that each student generates a unique number. The number of digits in the final number isn’t important either. For this lab assignment, you are asked to calculate the “sum” of your name in MIPS assembly code. The MIPs code will be developed by translating two C functions. In earlier courses, you learned how to define and use groups of characters stored in an array. For example, in C language an array is defined to store all the letters in “russell Show transcribed image text
Expert Answer
Answer to 1 Obiectives Assignment O Understand Implement High Level Language Statements Using Low Le Q29694828 . . .
OR