What is dynamic data structure?

1.	What is dynamic data structure?
Answer» 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. Dynamic data structures change in size by having unused memory allocated or de-allocated from the heap as NEEDED. Dynamic data structures play a key role in programming LANGUAGES like C, C++, and Java because they provide the programmer with the flexibility to adjust the memory CONSUMPTION of software programs.

Answer»

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. Dynamic data structures change in size by having unused memory allocated or de-allocated from the heap as NEEDED.

Dynamic data structures play a key role in programming LANGUAGES like C, C++, and Java because they provide the programmer with the flexibility to adjust the memory CONSUMPTION of software programs.

Discussion

No Comment Found

Related InterviewSolutions

What is the use of a semicolon (;) at the end of every program statement?
Merge Two sorted Linked List
Write a program to find the node at which the intersection of two singly linked lists begins.
Program to find n’th Fibonacci number
Check for Balanced Parentheses using Stack
Reverse the Linked List. Input: 1->2->3->4->5->NULL Output: 5->4->3->2->1->NULL
Check whether the number is EVEN or ODD, without using any arithmetic or relational operators
Multiply an Integer Number by 2 Without Using Multiplication Operator
Subtract Two Number Without Using Subtraction Operator
Add Two Numbers Without Using the Addition Operator