Interested to Buy Any Domain ? << Click Here >> for more details...
What are dynamic data structures?
- 2 Answers
- 1333 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / nashiinformaticssolutions
Data structures like linked lists and trees that grow or shrink during runtime.
| Is This Answer Correct ? | 0 Yes | 0 No |
Answer / 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 |
Explain the expression trees?
What are the pre-requisite for the collection to perform binary search?
How do you rotate an AVL tree?
Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?
What is the best sorting technique?
What is linear and non linear structure?
Can we override compareto method for enumerations?
A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute?
Explain linear linked implementation of Stack and Queue?
Can you provide some implementation of a dictionary having large number of words?
Define hashing?
What is a list of lists?
Windows 
