Polynomials like  5x⁴   +  2x³   +  7x²     +  10x  -  8  can  be  represented by using arrays. Arithmetic operations such as addition & multiplication of polynomials are common and most often; we have to write down a program to implement these operations.

The easiest way to represent polynomial of degree 'n' is to store up the coefficient of (n+1) terms of the polynomial in an array. To gain this, each of the elements of the array must contain two values, namely, exponent and coefficient. Whereas maintaining the polynomial, it is supposed that the exponent of each of the successive term is less than that of the earlier term. Once we create an array to represent a polynomial, we can employ such an array to perform common polynomial operations such as addition & multiplication.

Program 2 accepts 2 polynomials as input & adds them.

Posted Date: 4/4/2013 6:35:45 AM | Location : United States

Ask an Expert

Related Discussions:- Polynomials, Assignment Help, Ask Question on Polynomials, Get Answer, Expert's Help, Polynomials Discussions

Write discussion on Polynomials
Your posts are moderated

Write your message here..

Related Questions

Compound interest, Write the algorithm for compound interest Write the algorithm for compound interest

Algorithm, what algorithms can i use for the above title in my project desi... what algorithms can i use for the above title in my project desing and implmentation of road transport booking system

Interest rate, explain the determination of interest rate in the classical ... explain the determination of interest rate in the classical system.

Splaying steps - splay trees, Readjusting for tree modification calls for r... Readjusting for tree modification calls for rotations in the binary search tree. Single rotations are possible in the left or right direction for moving a node to the root position

State warnock algorithm, Warnock's Algorithm An interesting approach to... Warnock's Algorithm An interesting approach to the hidden-surface problem was presented by Warnock. His method does not try to decide exactly what is happening in the scene but

A bst is traversed in which order recursively, A  BST is traversed in the ... A  BST is traversed in the following order recursively: Right, root, left e output sequence will be in In Descending order

Explain the term group support system, (a) Explain the term Group Support S... (a) Explain the term Group Support System and elaborate on how it can improve groupwork. (b) Briefly explain three advantages of simulation. (c) Explain with the help of a

What are the languages which support assertions, What are the languages whi... What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

Data Structure, Ask consider the file name cars.text each line in the file ... Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

Algorithm to add element in the end of circular linked list, Q. Write down ... Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists