# Please can anyone do this within 5 hours?

[Posting or Asking for Direct Contact Details is Prohibited - GAF Admin]

I need help with the following. Here, assembly language means Y86. There should be four separate files when complete.

1) Implement dot-product of two vectors in assembly language. Assume an array of 4 elements is used to represent a vector. Should take input (1, 2, 3, 4) and (4,3,2,1)

2) Use the function developed for P1 to implement matrix multiplication in assembly language. Simply consider two 4-by-4 matrices. [0, 1, 0, 1; 1, 0, 1, 0; 0, 1, 0, 1; 1, 0, 1, 0]

3) Implement a function in assembly language to traverse a linked list and sum up all elements (non-recursively). (1)-&amp;gt;(2)-&amp;gt;(3)-&amp;gt;(4)

4) Redo (3) with recursion.

Here's a bit I started with but doesn't work properly. I can call Multiply once. If I call it a second time it never gets back to the halt in Main.

# int multiply(int number_1, int number_2)

Multiply: pushl %ebp

rrmovl %esp,%ebp

mrmovl 12(%ebp),%ecx # ecx = number_1

mrmovl 8(%ebp),%edx # edx = number_2

irmovl \$0, %eax # sum = 0

andl %edx,%edx

je mEnd

mLoop: addl %ecx,%eax # add to sum

irmovl \$-1,%ebx #

addl %ebx,%edx # number_2--

jne mLoop # Stop when 0

mEnd:

rrmovl %ebp,%esp

popl %ebp

ret

#int dotproduct(int vector_1, int vector_2)

DotProduct: pushl %ebp

rrmovl %esp,%ebp

mrmovl 12(%ebp),%ecx # ecx = vector_1

mrmovl 8(%ebp),%edx # edx = vector_2

irmovl \$0, %edi # sum = 0

irmovl \$1, %ebx

mrmovl (%ecx), %eax

pushl %eax

mrmovl (%edx), %eax

pushl %eax

call Multiply

popl %eax

popl %eax

rrmovl %edi,%eax

rrmovl %ebp,%esp

popl %ebp

ret

here is the more information regarding the project

Just some stuff I found when reviewing the project:

has a template for linked lists and multiplication.

There's a simulator on csapp website it would be best if you ran it with:

1) Download the source package from [url removed, login to view] under Chapter 4: Processor Architecture

2) Edit the Makefile so the lines beginning with GUIMODE, TKLIBS, and TKINC are commented out.

3) Save the Makefile and run make.

4) The simulator is run like this: ./ssim &lt; [url removed, login to view]

Can anyone do this ? or can anyone convert the same project hwich have written in C program to Y86 processor coding and simulate it and get the result.if you do this,I'll provide you more projects.But this should be done perfectly
my gmail ID:tutorapex

can someone help with this java assignment
Problem 1. In the last computer project, you built several divided difference tables to construct various Lagrange interpolating polynomials for f(x) = integral (1/(1 + x^2) (from 0 to 1)
on the interval [-5,5]. For this problem, split up the interval [-5,5] into 10 sub intervals with equally spaced endpoints starting at -5.0.
(a) Over each sub interval, approximate f(x) with a cubic Hermite polynomial. Notice that on each sub interval, x_o is the left endpoint and x_1 is the right endpoint. Your output should consist of the coefficients of each Hermite polynomial (specifying the interval being used). Then by hand, write out each Hermite polynomial. For each polynomial, specify which sub interval you used to get that polynomial.
(b) For each sub interval, determine experimentally an approximate upper bound by computing
stepping across each sub interval with step size = 0.01. Your output should display each sub interval and the experimental upper error bound on these sub intervals.

I will provide links to help and will attach other documents if necessary. Most importantly is the deadline which is in at most 24 hours.

My professor added this note as hint on how to work this problem:

Hint: you need to build 10 Hermite polynomials, each of degree 3. For the interval [-5, 5], chop it up into ten equal pieces [-5, -4], [-4, -3], ..., [4, 5]. Take the first sub interval [-5, -4]. Set x_0 = -5 and x_1 = -4. Then to build the Hermite polynomial, you would set z_0 = z_1 = -5 and z_2 = z_3 = -4. Then build the divided difference table with these four z values and construct the polynomial.

Repeat the process for [-4, -3], and then for [-3, -2], and so on. That will give you the ten Hermite polynomials, and then you can use these to find the experimental error
i cant pay you
if you do this
i'll be providing more work on client request
add me to gtalk
tutorapex