Q. Explain any three methods or techniques of representing polynomials using arrays. Write which method is most efficient or effective for representing the following polynomials.

 

8x¹⁰⁰+10x+6

8x³-7x²+5x+15

 

Ans.

The three methods or techniques of representing polynomials using arrays is given as follows

(1) if maximum value of exponent of a polynomial is m then describe an array of size m+1 and store coefficient in corresponding index position or location as exponent. Ex:

2x² +1 is stored as

(2) The one-dimensional  array  is  used  to  store  exponent  and  coefficient alternatively. Ex: 2x² +1 is stored as

The  size  of  array  needed  is  2*n  where  n  is  the  number  of  elements  in

polynomial.

(3) Use  two dimensional arrays  or  one-dimensional  array  of  structures  one  for  storing exponents and other for co-efficient.

Ex: 2x2 +1 is stored as

The size of arrays is 2*n where n is the number of the elements in polynomial. (i)  The second and third methods or techniques are the efficient methods.

For saving 8x¹⁰⁰+10x+6  , as in method 1 there is a requirement of 101 integer locations.

(ii) 8x³-7x²+5x+15 for this polynomial any one of the representations can be used, but method or technique 1 will be best as there is only coefficients required to be stored. There are no gaps in the exponents; hence the complete array will be filled with the coefficients.

Posted Date: 7/13/2012 2:37:53 AM | Location : United States

Ask an Expert

Related Discussions:- Techniques of representing polynomials using arrays, Assignment Help, Ask Question on Techniques of representing polynomials using arrays, Get Answer, Expert's Help, Techniques of representing polynomials using arrays Discussions

Write discussion on Techniques of representing polynomials using arrays
Your posts are moderated

Write your message here..

Related Questions

Dqueue, algorithm of output restricted queue. algorithm of output restricted queue.

Time complexity, how to learn about time complexity of a particular algorit... how to learn about time complexity of a particular algorithm

Queue, algorithm for insertion in a queue using pointers algorithm for insertion in a queue using pointers

Stack, how we will make projects on stack in c? how we will make projects on stack in c?

FIRST function in the compiler construction, I need a recursive algorithm t... I need a recursive algorithm to implement the FIRST function to any grammar

Depth first search and breadth first search, Q. Illustrate the result of ru... Q. Illustrate the result of running BFS and DFS on the directed graph given below using vertex 3 as source.  Show the status of the data structure used at each and every stage.

#titleprogram of sumseries in python, Program of sun series Program of sun series

What is complexity, Complexity is the rate at which the needed storage or c... Complexity is the rate at which the needed storage or consumed time rise as a function of the problem size. The absolute growth based on the machine utilized to execute the program

Total impedent of the circuit, an electrical student designed a circuit in... an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

The space - time trade off, The best algorithm to solve a given problem is ... The best algorithm to solve a given problem is one that requires less space in memory and takes less time to complete its execution. But in practice it is not always possible to