CS325 Homework 5 Help

I'm really struggling with this class, and any explanations would be great. The teacher is a very nice older gentleman, but I just can't understand his train of thought. He seems to be teaching you to do things with an expectation that you already know most everything he's talking about, so please explain thought processes going into the solving of these problems! The code would also be appreciated, but if you don't feel like sharing the code you used to solve this that is understandable, but a nudge in the right direction would be great. My junior college only taught us Java (not JScript), and all of my pro-school classes are in C/C++ for the most part, which I had to try to learn ASAP over the summer. This has not gone well for me lately.

Homework # 5 Polynomial Multiplication In this homework, you will contrast different methods of multiplying two polynomials with n coefficients where n-2 1. Write a program that uses the classical iterative method for multiplying two polyno- 2. Write a program that uses the divide and conquer algorithm (which reduces the problem 3. Write a program that uses the Fast Fourier Transform technique for multiplying poly- mials to three half size multiplications) for multiplying polynomials nomials 4. Compute to order the run times for the these methods. (You can cite the book or notes for this). Which one do you expect to be the fastest for large degree polynomials? 5. Choose several pairs of polynomials, P and Q, for various reasonable valucs of n (poly- nomial degree -2 -1) and compute the products PQ of the polynomials using your programs. Show that your programs all give the same results, or explain why your programs give differing results 6. Plot the running times of your programs as a function of the number of cocfficients (Pick a reasonable plotting format to help display the differences between the methods.) 7. Which program runs faster for a small number of coefficients? Use your runtime plots to predict when the other programs might become faster (i.e. the crossover points). Homework # 5 Polynomial Multiplication In this homework, you will contrast different methods of multiplying two polynomials with n coefficients where n-2 1. Write a program that uses the classical iterative method for multiplying two polyno- 2. Write a program that uses the divide and conquer algorithm (which reduces the problem 3. Write a program that uses the Fast Fourier Transform technique for multiplying poly- mials to three half size multiplications) for multiplying polynomials nomials 4. Compute to order the run times for the these methods. (You can cite the book or notes for this). Which one do you expect to be the fastest for large degree polynomials? 5. Choose several pairs of polynomials, P and Q, for various reasonable valucs of n (poly- nomial degree -2 -1) and compute the products PQ of the polynomials using your programs. Show that your programs all give the same results, or explain why your programs give differing results 6. Plot the running times of your programs as a function of the number of cocfficients (Pick a reasonable plotting format to help display the differences between the methods.) 7. Which program runs faster for a small number of coefficients? Use your runtime plots to predict when the other programs might become faster (i.e. the crossover points)