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
When is a graph said to be weakly connected?
Which searching algorithm is best?
Which sorting is used in collections sort?
What is vector and types of vector?
Can I provide array size dynamically?
How are elements stored in hashset?
Is arraylist a collection?
What is the difference between ienumerable and list?
How do you create a tree diagram?
Define a queue?
Does hashmap allow duplicate keys?
What is difference between static and dynamic array?
What is a list in data structure?
What is java priority queue?
What is the complexity of arraylist?
