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 does list clear do?
What is reduction to sorting method?
Are dictionaries mutable?
What is comparator interface used for?
What happens when arraylist is full?
Model a data structure for a DFA that takes an event as parameter and performs a desired action.
Explain the term run-time stack?
Write the recursive c function to count the number of nodes present in a binary tree.
Which sorting method is slowest?
List the data structures which are used in rdbms.
What is numeric array?
Is treeset sorted?
You are given a singly linked list. How would you find out if it contains a loop or not without using temporary space?
What do you mean by quadratic probing?
What is difference between list and array list?