I need someone help me with this project the class name Algorithms and Data Structures

Dr. M. Owrang Algorithms and Data Structures (CSC520) Fall 2016

Homework # 1 (5 Points) Due: Sep. 27, 2016

------------------------------------------------------------------------------------------------------------------------

Consider the following polynomial

em-1 em-2 e0

A(X) = bm-1 X + bm-2 X + ... + b0 X

where each bi is a nonzero coefficient of A and the exponents ei are decreasing em-1 > em-2 > ... > e0

>= 0.

The above polynomial can be represented in a linked list, where each node in the list contains the

following information:

(Exponent, Coefficient, Link).

1. Write an algorithm to add two polynomials represented as linked lists as in the above scheme, and

store the result in another linked list.

Give an example to show how your algorithm works.

2. Discuss (in detail) the time complexity of your algorithm.

3. What can you say about the efficiency of your algorithm? Explain.

4. Can you think of a better way to represent and add two polynomials? Explain.