Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / d.balakrishnan
Data Structure is ways to store data, search data, and
retrieve it. It use is to optimize data storage and the
ability to access it. It include things like list and trees.
So, basically some data structures are better for certain
kinds of data. In that it allows you to pull data quicker
faster. Algorithms are based on there speed to access the data.
| Is This Answer Correct ? | 3 Yes | 3 No |
Post New Answer View All Answers
What is complete binary tree and almost complete binary tree?
What does adt stands for?
Is quicksort a stable sorting algorithm?
Is arraylist fail fast?
Define leaves?
Is quicksort divide and conquer?
Is treemap sorted?
Describe queue operation.
What is a matrix?
Differentiate between an array and an arraylist.
Define internal nodes?
What is precision in data structures?
Name few classes that implement collection interface?
What are the types of array operations?
What are the advantage of collection classes over arrays?
