Write assembly code to evaluate the following expression. dVal = ( aVal + bVal +cVal ) + (dVal - aVal) %3D You can use MOV, ADD, SUB, MOVZX, MOVSX instructions. You are not allowed t make any reduction in the above expression. You need to implement it the way it is provided. Paragraph B IU A

assembly language please with comment and screen shot of the out put

translate the following MIPS code to C. Assume that the variables i, j, and k areassigned to the registers $s0, $s1, and $s2, respectively. Assume that the baseaddress of the array A is in registers $s6.Loop: blt $s0, $s1, Exitbge $s1, $s2, Exitaddi $s1, $s1, 5j LoopExit:addi $t0, $zero, 4ble $s0, $t0, Donesll $t1, $s0, 2add $t2, $s6, $t1sw $zero, 0($t2)Done:

Below you can see a Mealy and Moore design code as well as simulation (test bench) code. Can you write note on side of code illustrating what the line represents and explain how the two codes are behaving differently?    Mealy: Design source code: module mealy #Example of where the notes should go to represent how the lines are behaving ( input shift_start, input shift_stop, input rst, input clk, input d, output reg [7:0] q );   parameter Idle  =2'd0; parameter Start =2'd1; parameter Run   =2'd2; parameter Stop  =2'd3;   reg [1:0] state; reg [4:0] delay_cnt;   always @(posedge clk or negedge rst) begin     if(!rst)     begin         state <= Idle;         delay_cnt <= 0;         q <= 0;     end     else     case(state)         Idle : begin                 if(shift_start)                     state <= Start;                 end         Start : begin                  if(delay_cnt ==5'd99)                  begin                     delay_cnt <= 0;                     state…

Please read these instructions very carefully and follow them exactly how they are meant to be done the code is done and C code not C++ by the way        1) largest Write a function int largest(int a[],int n) that will find the largest int in the n ints in a. This should be the only function in the file. Generate assembly language for this code using -S. Identify the variables in this code, defining a table in comments in the code. Comment each line of code, indicating what it is doing in terms of the original C code. 2) Before you move on, make a copy of your .s file. 3) Generate optimized code for the same C code. You do this with the -O (-Os if you are on MacOS) switch to gcc For example,     gcc -S -O largest.c will generate largest.s (clobbering your first version if you did not save it elsewhere!) Build the same variable table and code comments for this version. Submit largest.c and both copies of largest.s with your comments.

Using MIPS in assembly language, you are to create a MIPS program that demonstrates that the associative law fails in addition for floating point numbers (single or double precision). You only need to demonstrate it for single precision. Remember the associative law is a + (b + c) = (a + b) + c. *Include a screenshot of the code running, Also have a lot of comments in your program as this is an assembly language program. Make the code neat and readable.

You must complete this in Python and the programs should not take any command-line arguments. You also need to make sure your programs will compile and run in at least a Linux environment. In this problem, you need to implement operation bit encoding for Assembly instructions. Given a line of text, your program should check whether it is a valid Assembly instruction type. If it is, your program should print out the opcode and optype of that instruction type; if the line of text is not exactly a valid Assembly instruction, your program should skip it and move to the next line of input without printing anything. Input Format The input to the program will consist of some number of lines. Each line contains some text, either a valid Assembly instruction type (with no extra whitespace or other characters, e.g. READ on a line by itself) or some other text. Constraints There are no specific constraints on the length or number of lines. They will be in a reasonable limit, as demonstrated by…

You must complete this in Python and the programs should not take any command-line arguments. You also need to make sure your programs will compile and run in at least a Linux environment.    In this problem, you must implement a tokenizer for the Assembly instruction format: an operation type (e.g. SUBI) followed by a comma-separated list of parameters (e.g. R0, R1, 6). If a line has an invalid syntax, it should be skipped in the output. You do not need to check whether the operations and arguments are valid Assembly instructions: you just need to separate them into tokens. Input Format The input to the program will consist of some number of lines. Each line is of the following form: "op arg1, arg2, ..., argn". Your program should terminate upon receiving a blank line or EOF. Constraints There are no specific constraints on the length or number of lines. They will be in a reasonable limit, as demonstrated by the included test cases, all of which are public. This is not a…

A machine code before loading into the loader on pep/9 simulator is given below. Please show the program before entering the assembler and give a brief description of the overall purpose of the program. D1 FC 15 E1 00 16 D1 FC 15 61 00 16 81 00 18 91 00 1A F1 FC 16 00 00 00 00 OF 00 30 zz