Techniques of representing polynomials using arrays, Data Structure & Algorithms

Assignment Help:

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.

 

8x100+10x+6

8x3-7x2+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:

2x2 +1 is stored as

829_array.png

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

2005_array1.png

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

525_array2.png

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 8x100+10x+6  , as in method 1 there is a requirement of 101 integer locations.

(ii) 8x3-7x2+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.


Related Discussions:- Techniques of representing polynomials using arrays

Sorting, explain quick sort algorithm

explain quick sort algorithm

Sorting algorithm, Sorting Algorithm A sorting algorithm is an algorit...

Sorting Algorithm A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Eff

Asymptotic notation.., important points on asymptotic notation to remember

important points on asymptotic notation to remember

Define the external path length, Define the External Path Length The Ex...

Define the External Path Length The External Path Length E of an extended binary tree is explained as the sum of the lengths of the paths - taken over all external nodes- from

Applications of b-trees, A database is a collection of data organized in a ...

A database is a collection of data organized in a manner that facilitates updation, retrieval and management of the data. Searching an unindexed database having n keys will have a

Compound interest, Write the algorithm for compound interest

Write the algorithm for compound interest

Search on a hashed file, Write a program to simulate searching over a hashe...

Write a program to simulate searching over a hashed file, with different assumptions for the sizeof file pages.Write a program to perform equality search operations on the hashed f

Algorithm, write an algorithm for the gpa of six students

write an algorithm for the gpa of six students

Recursive and iterative handling of a binary search tree, This section pres...

This section prescribes additional exercise with the recursive and iterative handling of a binary search tree. Adding to the Binary Search Tree Recursively Add implementation

Implementation of queue using a singly linked list, Implementation of queue...

Implementation of queue using a singly linked list: While implementing a queue as a single liked list, a queue q consists of a list and two pointers, q.front and q.rear.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd