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

All pairs shortest paths, N = number of rows of the graph D[i[j] = C[i][... N = number of rows of the graph D[i[j] = C[i][j] For k from 1 to n Do for i = 1 to n Do for j = 1 to n D[i[j]= minimum( d ij (k-1) ,d ik (k-1) +d kj (k-1)

Data structure, Ask question #Minimum 1Mark each of the following statement... Ask question #Minimum 1Mark each of the following statements as valid or invalid. If a statement is invalid, explain why. a. current ¼ list; b. temp->link->link ¼ NULL; c. trail->l

Algorithm and flow chart, algorithm and flow chart to find weather the give... algorithm and flow chart to find weather the given numbers are positive or negative or neutral

Post order traversal, Post order traversal: The children of node are vi... Post order traversal: The children of node are visited before the node itself; the root is visited last. Each node is visited after its descendents are visited. Algorithm fo

Order os quick sort in worst case, In worst case Quick Sort has order   O... In worst case Quick Sort has order   O (n 2 /2)

Adjacency multilist of directed graph, I want to study example I want to study example

Graph traversal, 1) Which graph traversal uses a queue to hold vertices whi... 1) Which graph traversal uses a queue to hold vertices which are to be processed next ? 2) Which of the graph traversal is recursive by nature? 3) For a dense graph, Prim's a

Graph terminologies, Graph terminologies : Adjacent vertices: Two vert... Graph terminologies : Adjacent vertices: Two vertices a & b are said to be adjacent if there is an edge connecting a & b. For instance, in given Figure, vertices 5 & 4 are adj

Merge sort, Merge sort is a sorting algorithm which uses the basic idea of ... Merge sort is a sorting algorithm which uses the basic idea of divide and conquers. This algorithm initially divides the array into two halves, sorts them separately and then merge

Deletion algorithm for dequeue, Deletion Algorithm for dequeue Step 1:... Deletion Algorithm for dequeue Step 1: [check for underflow]   If front = 0 and rear = 0   Output "underflow" and return Step 2: [delete element at front end]   If front