Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / glibwaresoftsolutions
The ability to grow and shrink while a program executes is a property of dynamic data structures. Because it adapts to the scale of the data to be edited, it offers a particularly versatile technique of data manipulation.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What are the two types of data?
How many types of search algorithms are there?
What's difference between stack and queue?
What is subtree?
Can sets contain duplicates?
When ArrayIndexOutOfBoundsException occurs?
Are duplicates allowed in list?
What is a directed graph?
Which process places data at the back of the queue?
What do you mean by hash function?
What does arrays tostring do?
Which sorting has less time complexity?
What is selection sort with example?
What is huffman’s algorithm?
Where is insertion sort used?
