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

Program to manipulate the data structure, Data Structure and Methods: ... Data Structure and Methods: Build an array structure to accomodate at least 10 elements. Provide routines for the following: An initializer. A routine to populate (

Dynamic memory management, How memory is freed using Boundary tag method in... How memory is freed using Boundary tag method in the context of Dynamic memory management? Boundary Tag Method to free Memory To delete an arbitrary block from the free li

Name the four data type groups, There are four data type groups:  I... There are four data type groups:  Integer kepts whole numbers and signed numbers Floating-point Stores real numbers (fractional values). Perfect for storing bank deposit

Boar corloring, Board coloring , C/C++ Programming Board coloring , C/C++ Programming

Write stream analogues of list processing functions, (a) Write (delay ) as... (a) Write (delay ) as a special form for (lambda () ) and (force ), as discussed in class. (b) Write (stream-cons x y) as a special form, as discussed in class. (c) Write

Multiple stack, implement multiple stack in single dimensionl array.write a... implement multiple stack in single dimensionl array.write algorithms for various stack operation for them

Time complexity, The  total  of  time  needed  by  an algorithm to run to i... The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

Primitive data structure, Primitive Data Structure These are the basic ... Primitive Data Structure These are the basic structure and are directly operated upon by the machine instructions. These in general have dissimilar representations on different

High-level and bubble algorithm , 1. Give both a high-level algorithm and a... 1. Give both a high-level algorithm and an implementation (\bubble diagram") of a Turing machine for the language in Exercise 3.8 (b) on page 160. Use the ' notation to show the co

Fibonnaci series, pseudo code for fibonnaci series pseudo code for fibonnaci series