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.
You need to write a function that performs multiplication of two numbers in your data structure. Again, remember how you multiply numbers in base 10 and you should be fine. Multipl
Q. Create a heap with the given list of keys: 8, 20, 9, 4, 15, 10, 7, 22, 3, 12 Ans: Creation
Write an algorithm to test whether a Binary Tree is a Binary Search Tree. The algorithm to test whether a Binary tree is as Binary Search tree is as follows: bstree(*tree) {
This unit discussed about data structure called Arrays. The easiest form of array is a one-dimensional array which may be described as a finite ordered set of homogeneous elements
Demonstrate that Dijkstra's algorithm does not necessarily work if some of the costs are negative by finding a digraph with negative costs (but no negative cost dicircuits) for whi
Two linked lists are having information of the same type in ascending order. Write down a module to merge them to a single linked list that is sorted merge(struct node *p, stru
Assertions and Abstract Data Types Even though we have defined assertions in terms of programs, notion can be extended to abstract data types (which are mathematical entities).
basic calculation for algorith.
Q. Write down a non recursive algorithm to traverse a binary tree in order. Ans: N on - recursive algorithm to traverse a binary tree in inorder is as
Enumerate the Types in Ruby Ruby is a pure object-oriented language, meaning that all types in Ruby are classes, and each value in a Ruby program is an instance of a class. Thi
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