Answer Posted / hrpynux@gmail.com
A dynamic data structure (DDS) refers to an organization or collection of data in memory that has the flexibility to grow or shrink in size, enabling a programmer to control exactly how much memory is utilized.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What is difference between list and set?
Define a set?
Define shortest path?
What are the properties of binary heap?
Define primary clustering?
Differentiate between hashset and treeset.
Explain quick sort and merge sort algorithms.
How many passes are required in bubble sort?
Can hashtable have duplicate values?
What is an object array?
Why is it important to sort waste?
What is stable sorting method?
What is the complexity of arrays sort?
Which interfaces are implemented by concurrentskiplistset?
Name few classes that implement collection interface?
