Risc-v 1:Write an Assembly language code that returns the result based on the logic given. If n is even, it returns the result of below expression n^2 + (n − 1)^2 + (n − 2)^2 + (n-3)^2 +(n-4)^2 +( n-5)^2 If n is odd , it returns the result of below expression n^2 + (n + 1)^2 + (n + 2)^2 + (n+3)^2 +(n+4)^2 +( n+5)^2

Risc-v 1:Write an Assembly language code that returns the result based on the logic given. If n is even, it returns the result of below expression n^2 + (n − 1)^2 + (n − 2)^2 + (n-3)^2 +(n-4)^2 +( n-5)^2 If n is odd , it returns the result of below expression n^2 + (n + 1)^2 + (n + 2)^2 + (n+3)^2 +(n+4)^2 +( n+5)^2

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

x86 assembly language Write a general-purpose program with loop and indexed addressing that adds 12h to 0th, 3rd , 7th , 11th ,15th ,19th , … elements of a DWORD array. For example, in array: Array1 DWORD 12h, 13h, 14h,15h, 16h, 17h, 18h, 19h, 1ah, 1bh, 1ch, 1dh, 1eh, 1fh becomes: Array1 : 24h, 13h, 14h, 27h,16h,17h,18h, 2bh, 1ah, 1bh, 1ch, 2f, 1eh, 1fh I did the following code buts it wrong. I need to do it without using no Lea, no HLT, and no RPT. How would I do that? .CODE LEA SI,ARRAY1MOV CX,4MOV AX,0ADD [SI],12HADD SI,0CHADD [SI],12H;repetition with indexed addressing modeRPT:ADD SI,10HADD [SI],12HLOOP RPTHLT
The 32-bit RISC-V base integer instruction set (rv32i) does not support multiplication and division operations. To deal with this, a compiler may call a function when a multiplication is needed. For example, gcc expects that a function - mulsi3(unsigned int a, unsigned int b) is provided to multiply two integers. A multiplication can be carried out by repeated additions and shifts: unsigned int -_mulsi3 (unsigned int a, unsigned int b) { unsigned int r = 0; while (a) { if (a & 1) { r += b; } a >>= 1; b <<= 1; } return r; } a) Translate the above C code into equivalent RISC-V rv32i assembler code. Comment the as- sembler code to explain how the calculation proceeds. Note that the arguments are passed via the registers a0 (x10) and a1 (x11) and that the result is returned in a0 (x10). b) Does the function need function call prolog and epilog? Explain why or why not. You are invited to use emulsiV to develop and test your assembler code.
x86 Assembly Programming-MASM - Use Irvine32.inc Write a program with a loop and indexed addressing that calculates sum of the values of elements of a DWORD array that are located at multiple of 5 location. For example for the array 2,3,4,5,6,7,8,9,10,11,12,13,14,15 Program calculates: 5+10+15
Write a complete Assembly Language program for (80x60) microprocessor to: Find the largest and smallest number from an array present in the memeory locations 0401-040A and store the Largest number in 040B (Largest No) and 040C (Smallest No). Note :numbers in the array are [67h,32h,6Fh,57h,22h,16h,08h,49h,78h,1Dh]. Show the output after execution.
8. Consider the following C code snippet. // c code void setArray(int num) { int i=5; compare (4, i); int compare (int a, int b) { if (sub (a, b) >= 0) return 1; else return 0; int sub (int a, int b) { return a - b; Implement the C code snippet in ARM assembly language. Use R4 to hold the variable i.
in assembly language x86 Masm, Write a program that calculate the first seven values of the Fibonacci number sequence, described by the following formula: Fib(0) = 0, Fib(1) = 1, Fib(2) = Fib(0)+ Fib(1), Fib(n) = Fib(n-1) + Fib(n-2). Implement the Fibonacci number sequence using a recursive function call. Take screenshots showing the stack frames on the memory window and the results.
Please solve this problem in emu8086 microprocessor in Assembly Language. Please solve properly, will upvote after getting proper solve Read 10 inputs (range 0-9) from the user and store them in an array. Find the position (or index) of the maximum and minimum values in the array, and swap them (move the biggest element to the position of the smallest, and move the smallest element to the position of the biggest), and print that again. If there are multiple maximum or minimum numbers, then choose the first occurrence, values. Your program should be able to handle negative values. Explanation: Here from the given input we see that 9 is the maximum number and it has occurred twice, first in the 2nd index and again in the 5th index. Similarly here 3 is the least and it also has appeared twice, once in the 3rd index and again in the 6th index. So we swap 9 and 3 from the 2nd and 3rd indices and then after swapping, print the new array. Input: 7935935874 Output: 7395645874 Comment:Range 0…
int i; float x[5], y[5]; [ lots of code deleted... ] for (i=0;i y[i]) x[i] = x[i] + y[i]; [ more code deleted... ] Translate to MIPS assembly language:
Create a x86 assembly function for this c code: /*float calculateAvg ( float blocks[ ], int SIZE ) { float AVG = 0.0; for ( int i = 0; i < SIZE; i++ ) AVG += fabsf ( blocks[ i ] ); AVG = AVG / ( float ) SIZE; return AVG;} */
Computer Science I need an assembly code in x8086 for the following question: Declare an array with a size between 4-10, and fill with random generated numbers. Using a stack, store the numbers from the array then fill it again with random numbers and then store the sum between the previous values and new values in a new array.
80x86 Intel Assembly language Write an 80x86 Intel assembly language program: Declare two integer arrays and initialize the first one with 7, 6, 5, 4 and 3. Initialize the second one with 3, 6, 9, 10, 15 Declare the third array of the same size but do not initialize. Your program must initialize ESI and EDI to have the addresses of the array1 and array2 respectively. Use EBX and place the address of the third array in that register. Use these registers to add the first element of the first array to the first element of the second array and place the result in the third array. Updated the values of these registers so all of them refer to the next location.
assembly language programs for the 8086 microprocessors to perform multiplication of two matrices Am*n and Bn*p. The value of m = 4, n = 2, and p =3. Assembly lan+ Assume all the elements in matrices A, B, and answer of the multiplication are 8-bit numbers. Flow chart Pseudocode Assembly Code with brief describe comments (EMU8086 emulator).