Polynomial Arithmetic
1. In a linked-list representation of a polynomial, which information is normally stored in each term node?
2. In a linked-list representation, how is the constant term represented as a coefficient-exponent pair?
3. When adding two polynomial linked lists, what should be done when the current terms have the same exponent?
4. Suppose a polynomial is represented by nodes ordered by decreasing exponent. Which node should be encountered first for ?
5. If two polynomial linked lists contain and terms respectively and both are traversed once to perform addition, what is the time complexity?
6. During polynomial addition, the current exponents are and . What should the algorithm do when the lists are maintained in decreasing exponent order?
7. What is the main advantage of using a linked list for a sparse polynomial?
8. If two terms and are encountered while adding two polynomial linked lists, what term should be placed in the result?
9. If a polynomial has terms and another polynomial has terms, what is the worst-case number of nodes that an addition algorithm may need to process?