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.
Give an algorithm to find both the maximum and minimum of 380 distinct numbers that uses at most 568 comparisons.
What is a linear array? An array is a way to reference a series of memory locations using the similar name. Every memory location is shown by an array element. An array elemen
In the array implementation of lists, elements are stored into continuous locations. In order to add an element into the list at the end, we can insert it without any problem. But,
A circular queue can be implemented through arrays or linked lists. Program 6 gives the array implementation of any circular queue. Program 6: Array implementation of any Circu
Question 1 What is a data structure? Discuss briefly on types of data structures Question 2 Explain the insertion and deletion operation of linked list in detail Question
algorithm and flow chart to find weather the given numbers are positive or negative or neutral
(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
Program: Program segment for insertion of an element into the queue add(int value) { struct queue *new; new = (struct queue*)malloc(sizeof(queue)); new->value = val
Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p
Define the Internal Path Length The Internal Path Length I of an extended binary tree is explained as the sum of the lengths of the paths taken over all internal nodes- from th
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