DATA STRUCTURE INTERVIEW QUESTION & ANSWERS
| 66. |
Describe bubble sort algorithm? |
| |
Bubble sort algorithm starts from one end of the list that is to be sorted.
It keeps comparing the adjacent elements starting from the first two to last two elements. For one traversal through the list, the last element contains the largest (or smallest, depending on the comparison function) element in that list The second step is repeated in the list leaving the last element. This process is repeated till there are no more elements to compare (or a pass completes in which there was no swapping done which means that the list is already in sorted order). |
| 67. |
What is Asymptotic Notation? |
| |
There are basically three types of mathematical notations for three different cases of time complexities. - Big oh or oh notation denoted as ‘O’
- Omega notation denoted as ‘omega’
- Theta notation denoted as ‘theta’
|
| 68. |
What is list? |
| |
List means collection of elements in sequential order.
In memory we can store the list in two ways, one way is we can store the elements in sequential memory locations.
|
| 69. |
What are the types of graphs? |
| |
Basically graphs are of two types :-
Directed graph
-
Undirected graph
|
| 70. |
Give any two properties of dynamic programming approach? |
| |
Optimal substructure : The dynamic programming technique makes use of principle of optimality to find the optimal solution from subproblems.
Overlapping subproblems : The dynamic programming is a technique in which the problem is divided into subproblems. The solutions of sub problems are shared to get the final solution to the problem. It avoids repetition of work and we can get the solution more efficiently.
|
