COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Polynomial
|
|
|
Sparse Matrix
|
|
|
Set
|
|
|
All the above
|
Detailed explanation-1: -Answer: Polynomial is a application of linked list . A polynomial is composed of different terms where each of them holds a coefficient and a exponent . A polynomial is p (x) is the expression in variable x which is in the form .
Detailed explanation-2: -Explanation: To implement file system, for separate chaining in hash-tables and to implement non-binary trees linked lists are used.
Detailed explanation-3: -linked list is a data structure that stores each element as an object in a node of the list. every note contains two parts data han and links to the next node. Polynomial is a mathematical expression that consists of variables and coefficients. for example x^2-4x + 7.
Detailed explanation-4: -When representing a polynomial using linked lists, each node will represent a term of the expression. For this purpose a node can be created in such a way that it consists of 3 parts: coefficient, exponent, and link .