Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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
(2) The one-dimensional array is used to store exponent and coefficient alternatively. Ex: 2x2 +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 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.
QUESTION Explain the following data structures: (a) List (b) Stack (c) Queues Note : your explanation should consist of the definition, operations and examples.
Write an algorithm to calculate a postfix expression. Execute your algorithm using the given postfix expression as your input : a b + c d +*f ↑ . T o evaluate a postfix expr
how to implement multiple stack using single dimension array in c
State in detail about the Integer Carrier set of the Integer ADT is the set {..., -2, -1, 0, 1, 2, ...}, and operations on these values are addition, multiplication, subtrac
Readjusting for tree modification calls for rotations in the binary search tree. Single rotations are possible in the left or right direction for moving a node to the root position
Write an algorithm using pseudocode which takes temperatures input over a 100 day period (once per day) and output the number of days when the temperature was below 20C and the num
Which sorting algorithms does not have a worst case running time of O (n 2 ) ? Merge sort
With the help of a program and a numerical example explain the Depth First Traversal of a tree.
The controversy of RISC versus CISC never ends. Suppose that you represent an advocate for the RISC approach; write at least a one-page critic of the CISC approach showing its disa
padovan string
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd