What is dynamic memory allocation? Compare data structure with abstract data type.


This answer is not selected as best answer. This answer may not be sufficient for exam.

Your limit has been exceed. We have implemented this system because, We got difficulty on managing our servers. Please donate some amount to remove this limit.

Quota: 0 / 30


Dynamic memory allocation is the process of assigning the memory space during the execution time or the run time.

The big advantage of dynamic memory allocation is that the sheer amount of memory seems to be unlimited. This observation does not hold for a fixed memory block allocated at the start time of the program or for the stack.

The difference between data structure and abstract data type are

SN Abstract Data Types Data Structure
1 Abstract Data Types or structures describe the data and the operations to manipulate and change it. Concrete data types or structures provide  how these operations are actually implemented.
2 Most of the program becomes independent of the abstract data types representation, so it can be improved without breaking the program. Which is not possible in Data Types or structure
3 It’s easier for each part of a program to use an implementation of its data types and that will be more efficient. It is not so efficient compared to ADT.
4 Implementation of a high level concept Implementation of a simple concept
5 It is usable beyond its original use. It is rarely reusable beyond its original use.
6 It hides the internal details. It doesn’t hide anything.
7 It uses class. It uses structure.
8 Examples- lists, sets, stacks. Examples-Arrays, linked lists, trees, graphs.
If you found any type of error on the answer then please mention on the comment or submit your new answer.
Leave your Answer:

Click here to submit your answer.

  Loading . . .