DATA STRUCTURE INTERVIEW QUESTION & ANSWERS
| 21. |
What is the difference between linked list and array data structures |
| |
| linked list |
arrays |
| The linked list is collection of nodes. Each node structure is having one data field and one next link field. |
The arrays is a collection of similar types of data elements. In the arrays the data is always stored at some index if the array. |
| Any element can be accessed by a sequential access only. |
Any element can be accessed randomly i.e. with the help of index of the array. |
| Physically the data can be deleted. |
Only logical deletion of the data is possible. |
| Insertions and deletions of the data is easy. |
Insertions and deletions of the data is difficult. |
| The memory allocation is dynamic. So the developer can allocate as well as deallocate
the memory.And so no wastage of memory is there. |
The memory allocation is static. So once the fixed amount of size is declared .that much memory is allocated.So there is a chance of either memory wastage or memory shortage. |
|
| 22. |
What is two dimensional arrays? |
| |
A 2D array is a collection of elements placed in m row, and n columns i.e., if we want to store the elements in the form of MATRIX then definitely we have to use the concept of 2D Array. |
| 23. |
Define polynomial? |
| |
A polynomial is the sum of terms where each term consists of variable, coefficient and exponent.
|
| 24. |
What are the various operations of polynomials? |
| |
Various operations which can be performed on the polynomial are,- Addition of two polynomials
- Multiplication of two polynomials
- Evaluation of polynomials
|
| 25. |
What is the difference between simple graph and multigraph? |
| |
A simple graph can just have a one edge between any two
vertices.
A multigraph can have more than one edge connecting two vertices.
|
