Write an ARMv8 assembly function to compute the sum of square of first n odd natural numbers using recursion. For example, if n = 3 then the sum is 12 +たす 32 +たす 52 =わ 35. The input n is in X1 and is signed 64-bit non-zero positive integer less than 101. Store the sum in X0. Assemble, test, and simulate the assembly code using DS-5 simulator

Write an Op-Code and assembly language program to implement addition [0600H]+[0601H] & substraction [0602H]-[0603H] of two 8-bit numbers and store the result in the Memory locations 0604H(sum), 0605H(carry),0606H(Difference) and 0607H(Borrow).

Consider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B If the machine is big endian and uses two’s complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex).

Implement code convertor Y=(X+4) mod 8 using decoder and encoder. Y and X are 3-bit numbers.

A processor uses a serial link to communicate with a keyboard for word processing. A typist using this keyboard can type at rates peaking at 120 words per minute, where a word is 6 characters (including spaces and punctuation). The characters will be transmitted from the keyboard in 8-bit ASCII with one stop bit and no parity. Only consider these and no special characters. The programmer writes setup and polling service routines based on a minimum baud rate, but then finds that the keyboard will only interface at 19.2 Kbaud. Will the polling service routine have to change? Why or why not? Baud Rates 300 600 1200 2400 4800 9600 19200

A digital counter is a device that generates binary numbers in a specified count sequence. The counter progresses through the specified sequence of numbers when triggered by an incoming clock waveform, and it advances from one number to the next only during the occurrence of a clock pulse. The counter cycles through the same sequence of numbers continuously so long as there is an incoming clock pulse. You are to build a 3-bit synci. us count-down counter, which is a counter that counts down goes throug.. Linnni states 111 to 000 and back to 111 to repeat the cou. are to use a positive-edge-tgered JK flip-flops. In the first step of the design, you ecu .- Flop inputs (1 column for each flip-flop input) The present state pur uv.. design and should enumerate the count sequence. The next state columns should specif wnicn slale wn cuo next, given the present state. For example, if circuit is in a present state of the nevt ate in a down-count sequence would be 0. You should design the FF...

Write a single assembly language program to implement addition [0600H]+[0601H] & substraction [0602H]-[0603H] of two 8-bit numbers and store the result in the Memory locations 0604H(sum), 0605H(carry),0606H(Difference) and 0607H(Borrow).

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

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.

Consider a 32-bit hexadecimal number stored in memory as follows: Address Value 100 2A 101 C2 102 08 103 1B If the machine is big endian and uses two’s complement representation for integers, write the 32-bit integer number stored at address 100 (you may write the number in hex). Make it fast

Write an ARM assembly program to check whether an N x N matrix is a magic square. A magic square is an N x N matrix in which the sums of all rows, columns, and the two diagonals add up to N(N + 1)/2. All matrix entries are unique numbers from 1 to N. If the matrix is a magic square, register RO will be set (i.e. all ones) upon completion; otherwise it will be cleared. Test the following matrix 16 5 9 4 3 10 6 15 2 11 7 14 13 8 12 1 Store the matrix element numbers in memory starting at location 0x20004000. Assume all numbers are Bytes