What is dynamic data structure?
- 1 Answers
- 850 Views
- I also Faced
- E-Mail Answers
What is dynamic data structure?..
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 |
More Data Structures Interview Questions
Why do we need sorting?
A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.
What is difference between hashtable and hashmap?
Is hashmap get thread safe?
What is inplace sorting?
What is the best complexity of bubble sort?
Is tuple immutable?
What is collections singletonlist?
What is meant by hashing?
In which matrix, we can use multilinked structures?
Explain what is B-tree?
Is hashmap sorted?
Windows 
