Assembler Answers

Write a MIPS program, using a loop, which computes the maximum of five

consecutive (32-bit) words in memory and store the result in a word labeled max . Declare and initialize this array as part

of your program. Verify the operation of your code using SPIM.

Reminder: MIPS uses byte addressing, so the addresses of successive words differ by

4, not 1

Using the LC-3 Assembler, how would you store user keyboard input into an array, two characters per 16 bit address, so as to utilize the PUTSP command to output the string?

write the program a language assembly enters two numbers and exist maximum between two number

•Implement greatest common divisor (GCD) of two integers. (three for bonus)
●Print out error message when the input is non-positive.
●Execute once per load.

I am asked to write a program in LC-3 assembly language that takes a 16-bit (2 byte) word stored at memory location x3100. It uses this as the number of words to search starting at address x3200 while summing the total number of 1’s in all the words. In the end, you will store the number of 1’s as a 16-bit word at address x3101.

I am asked to write a program in LC-3 assembly language that takes a 16-bit (2 byte) word stored at memory location x3100. It uses this as the number of words to search starting at address x3200 while summing the total number of 1’s in all the words. In the end, you will store the number of 1’s as a 16-bit word at address x3101.

how do you find out the physical address when you know the Code Segment and Source Index
for example:
CS= 0D123h ; SI= 0111h
the physical address will be 01D1341h
whats the math?

have to calculate the nth term in a tetrabonacci sequence using recursion. in x86 MASM assembly. It is similar to Fibonacci but instead of adding the previous two terms you add the previous four terms. I have written workable code where I get the first 5 n terms tetrabonacci sequence correct. But when n=6 my recursion method seems to not work. Can someone help me with where my code went wrong? .586
.model flat,C

.code

tetrabonacci PROC
push ebp ;save previous pointer
mov ebp,esp ;save current pointer
sub esp, 12 ;make room for local variable ptr
mov eax,[ebp+8] ; get n

;if ((n==1)|| (n==2) ||(n == 3)||(n===4)) return predetermined value, else do recursion on previous 4 terms

cmp eax,4 ; n<=4?
ja recursion ; n > 4 do recursion
jb exception1 ; n< 4 jump to exception1
mov eax,4 ;n=4 move 4 into eax
jmp Quit ;jump to end

exception1:

cmp

Suppose we have TEGRA, a multi-core mobile processor. While writing an application in assembly language for the given device, we have two options regarding code optimization.



Option A: Do necessary optimization steps before and then write the code.



Option B: First code the program in a normal way and then make necessary changes in order to optimize it.



Can we prefer any approach over the other or both are acceptable. Justify your answer with logical reasoning.