Write an ASM program that reads a value for the variable littleEndian and then uses a sequence of MOV instructions to fill the array bigEndian with the bytes of littleEndian in reverse order. For instance, if littleEndian = 12345678h then bigEndian should be filled as 12h, 34h, 56h, 78h. .data bigEndian BYTE ?, ?, ?, ? littleEndian DWORD 12345678h You must first read in an arbitrary value for littleEndian and then fill and display the content of bigEndian in a single line. For example: if I read the value FEDCBA98h for littleEndian, then bigEndian will be first filled and then displayed as FEh, DCh, BAh, 98h. littleEndian must be read as a hexadecimal number; use the readHex library function. Likewise, the cells of bigEndian must be displayed in hexadecimal; use the writeHex library function. Both functions are described in the textbook.

Write, and test using spim, an assembly language program that accepts asinput a sequence of 10 integers. These numbers should be stored in an array in memory,in the order in which they were input. Then, your program should prompt the user foran integer input and search the array to find the first occurrence (if any) of this integer.If found, output its position in the array as an integer between 1 and 10. Again, youneed only find the first occurrence. Your program should then prompt the user foranother integer input, and repeat. Once the input integer is NOT found in the array, yourprogram should terminate.

Implementing matrix addition is pretty simple; see the program below. However, the given addition function matrix_add_double() does not run at full speed. On the instructors computer, which has 16GB of RAM, the program below shows that the call to matrix_add_double takes 38571 ms, while another, better implementation achieves the same result in 3794.7ms, which is 10.2 times faster! Your job for this exercise is: • to explain what in the Operating System and/or CPU and/or other part of the system makes the implementation below go so slowly. • to fix the code to achieve full speed. Hint: There are two reasons why the code runs slowly. The one reason is related to how virtual addresses get translated to physical addresses, the other reasons is related to another effect in the hardware. Only the performance for the matrix_add_double function() counts for your exam results. You can leave the other parts of the code untouched, but you may also change them....

Given the array A=[3,7,-4,12;-5,9,10,2;6,13,8,11;15,5,4,1], what instruction is needed to create the following array from A, а. В-[-5,10;6,8] b. C=[3;-5;6]

You are to write an Intel x86 assembly language program which makes useof a loop to access the individual elements of the array containing the ASCIIcharacters. You are to initialize the array with the following db directive: message db 'juMping JAck flaSh #1',10, 0 The ASCII character represented by decimal value 10 (0x0A) is the line feedcharacter (similar to endl in C++). The byte with all zeros (the so called NULL character in ASCII) is used to represent the end of the string. Before entering the loop, which performs the case conversion, the program is to display on the screen the (original) contents of the string. Within the loop, the program is to determine whether the current character represents a lower case character. If the character is lower case, it is to be converted into its uppercase version. Non-alphabetic characters are to remain as is. Upon convertingall the lower case characters, the program is to display the string on the screen. Here is an example of a correct...

Write a program with a loop and indexed addressing that calculates the sum of all the gaps between successive array elements. The array elements are doublewords, sequenced in nondecreasing order. So, for example, the array 0, 2, 5, 9, 10 has gaps of 2, 3, 4, and 1, whose sum equals 10. assembly language

Write a C program to accept the user input (a positive integer) n, which represents thesize (or length) of an int array. Allocate the memory for this array according to n, andfurther initialise this array (from the first element to the last) using the number from n to1. You will need to consider the (potential) memory management issue.