Given an array of at least one integer, write a program to create a new array with elements equal to the exponent of each element in the original array raised to the index, Le, Bli]- sum of 1st/ elements of A For this, write the following two functions using Procedure Execution. (If procedure execution or functions are not used, you will receive a score of 0, even if the tests pass). . main • task Create array B by obtaining the sum from the nSum function . nSum inputs: base address of array A ("A), index of B (k) • task compute the sum of 1st k elements of array A. (If array A elements are overwritten, the updated values should be used.) return: sum of 1st k elements of array A Following is a sample C code to perform the required task. You may modify the code for the functions, but the task performed should not be changed int main() ( // Variable int A, B int n Declaration // Base addresses of A and B // Length of arrays A and B // Task of main function for (int j = 0; j

The assignment is 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. The key is to have two of the number large (one positively and one negatively but equal in magnitude) floating point numbers and the third floating point number very small in comparison. ***Please make sure you include comments in every field*** Note: make sure the program operats and doesnt run with errors like: operand is of incorrect type or not formatted

In this problem we will work through a round of DES. For notational simplicity, assume it is the first round. Please enter all answers as strings of 0's and 1's. The input is the 64 bit block 0000000000000010000000000000001000000100000001000100000000000000 Suppose that the subkey for the current round is this 48 bit number: 000000000000000001000000000000000000000000000000 What does the 64 bit state look like after the IP transformation is applied to the input? 00000000000110000100000000000000 Now find Lo and Ro, the left and right halves of the state. Lo 01000000010000000000000000010000 = Ro=00000000000000100000000000000000 What is the result of applying the expansion box to R₁? E(Ro) = 00000000000000100000000000000000 What is the result of XORing the subkey with E(Ro)? k₁ E(Ro) = 00000000000000100000000000000000 We now apply the S-box transformation. S(k₁ E(Ro)) = 11011000110110001101111110111100 Finally we apply the permutation box to complete the function f. f(Ro) = P(S(k₁ + E(Ro)))…

Solve using assembly language x86 processors and compatibles  Prompt the user for coefficients a, b, and c of a polynomial in the form ax​2 + bx + c = 0. Calculate and display the real roots of the polynomial using the quadratic formula. If any root is imaginary, display the appropriate message.