Write a MIPS assembly language program to read an arbitrary number of integer pairs from a file. Each pair will then be multiplied together with the results being accumulated (added together) forming a sum-of-products operation. Submit your report and code here.

Review the following snippet from an assembly code listing file (source assembly statements and listing file line numbers are removed purposely) and answer the questions. 00000000 B8 00000000 00000005 03 05 0000000A R 0000000B 66| 2B 15 00000008 R 00000012 41 00000013 69 15 0000000A R FFFFFED9 0000001D 8A C3 0000001F FF OD 0000000A R 00000025 661 B9 0019 1) Locate the instruction that has the smallest size object code (i.e. minimum byte-length), what is the corresponding address of the instruction? type your answer... 2) Locate the instruction that has the largest size object code (i.e. maximum byte-length). What is the byte-length of the instruction? type your answer... 3) How many of the above instructions have direct memory reference? choose your answer... 4) What is the total length (number of bytes) of the above object code snippet? type your answer... 5) How many instructions contain an opcode prefix? choose your answer...

Write a MARIE program simulation the following Python code. The MARIE program must generate the output similar to Python's. The program must have a loop.  Python code: num = [1,2,3,4,5,6]for i in num:    print (i) This is what I have so far but it only prints from 1 to infinity:  ORG 100START,  LOAD NUM        STORE COUNT        OUTPUT        LOAD NUM        ADD ONE        STORE NUM        LOAD NUM        SUBT COUNT        SKIPCOND 400  // Salta si COUNT < NUM        JUMP START         HALT ONE,    DEC 1NUM,    DEC 1COUNT,  DEC 1        END START

Your Question: Write a program in MARIE assembler to print “Hello World!”  Define the message as a “C” style NULL terminated string. The program must implement a loop,  like the pseudocode below. str =“Hello World!”   index = 0 while str[index] != 0      output str[index]       index = index + 1   ORG 100 START,  LOAD STR        STORE INDEXLOOP,   LOAD INDEX        ADD ONE        STORE INDEX        LOAD INDEX        ADD STR        STORE X        LOAD X        OUTPUT        JUMP END          JUMP LOOP END,    HALT STR,    HEX 0048        HEX 0065        HEX 006C        HEX 006C        HEX 006F        HEX 0020        HEX 0057        HEX 006F        HEX 0072        HEX 006C        HEX 0064        HEX 0021        HEX 0000 INDEX,  DEC 0ONE,    DEC 1X,      DEC 0 END  START   // it does not print anything, help pls

Write a MIPS assembly program to find the maximum number among three integers. Ask the user to enter the numbers, save the numbers, and perform the operations. Output the max and min numbers. Your solution should work for all input orders (3, 12, 9) or (3, 9, 12), or (12, 3, 9), etc. Example Enter the first number: 3 Enter the second number: 12 Enter the third number: 9 Output (should be exact) The maximum number is 12 and the minimum number is 3.

E In the following code block(Reference:Q11), you will a set of assembly instructions with corresponding line numbers (line numbers are for informational purpose only and they are not part of the source code). 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 mov edx, 5 dec ecx jmp LABEL1 mov eax, 1 LABEL1: mul edx jmp ecx mov edx, 0678h sub edx, eax jmp DWORD PTR [edx] neg ebx add ecx, ebx mov eax, 0 For each of the conditions/scenario listed below, indicate the corresponding line number (that cause or is associated with the condition/scenario). Enter 0 (Zero) if the condition is not caused by the block of code. 1) Memory indirect jump: type your answer... type your answer... type your answer... type your answer... 2) Register indirect jump: 3) Relative short jump: type your answer... 5) Two's complement type your answer... 4) Relative near jump: 6) Unreachable code

list: .word 3, 0, 1, 2, 6, -2, 4, 7, 3, 7 size: .word 10 Develop a mips code with a Mars simulator that reads this sequence and counts those <0 (negative) and >=0 (zero or positive) and prints what it finds to the screen.