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
Is array static or dynamic?
Differentiate between singly and doubly linked lists?
Can tuple be sorted?
Can a stack be described as a pointer? Explain.
What happens if we try to insert duplicate key in hashmap?
do records fall under linear or non linear data structures?
Which is faster hashmap or treemap?
Parenthesis is never required in postfix or prefix expressions, why?
What are arrays give example?
Describe what is Node in link list? And name the types of Linked Lists?
Which is best book for data structures?
Can we sort hashmap?
What are the Difference between tcp and udp?
What is an array vs list?
What is the difference between the hash table and hash map?
