answersLogoWhite

0

Polynomials in data structures are sets of pairs of coefficient and exponent in two set which are designed for comparison (less, great, equal) to made third one resulting polynomial.

Operations that can be performed on polynomial are :

  • Addition
  • subtraction
  • multiplication






User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

How data reconstruction is done by polynomial extrapolation?

its impossible.


What has the author Barbara Opozda written?

Barbara Opozda has written: 'Metric polynomial structures'


What is the fundamental difference between logical and physical data structures?

1) Logical data structures are structures that emphasize on data relationships and how data is related from the view of the user. 2) Physical data structures are data models that emphasize on the use of efficiently and effectively storing data in memory.


The need for complex data structures?

Explain the need for complex data structures


What is the linear data structures?

Linear data structures are 1-dimensional arrays, as in: vectors.


How can graphs of polynomial functions show trends in data?

The way you can use graphs of polynomial functions to show trends in data is by comparing results between different functions. The alternation between the data will show the trends. Time can also be used to show the amount of variation.


How linked list can be used for the polynomial manipulation?

Header linked list are frequently used for maintaining polynomials in memory. The header node plays an important part in this representation, since it is needed to represent the zero polynomial. This representation of polynomial will be presented in the context of a specific


Primary data secondary data?

primary data structures


What are primary data and secoundary data?

primary data structures


What is internal software data structures?

I think it is the objects(data structures) that are passed among the components of the software.


What has the author Michael B Feldman written?

Michael B. Feldman has written: 'Data Structures With Ada' 'Data structures with Modula-2' -- subject(s): Data structures (Computer science), Modula-2 (Computer program language) 'Data structures with Ada' -- subject(s): Ada (Computer program language), Data structures (Computer science)


What types of index data structures can you have?

There are three types of index data structures: unique, non-unique, bitmap