Dynamic data structures

Dynamic data structures

1. The Dynamic Data Structures are structures Whose That dimension can grow or shrink during the execution of the program.

   • Software applications use dynamic memory (allocated and deallocated in the system’s heap) to handle dynamism in their working conditions.
     • The Dynamic Memory Manager (DMM) is the software mechanism that handles the (de)allocation of blocks of varying sizes at runtime

2. Linear

   • linked lists
   • stacks
   • queues

3. Nonlinear

   • trees
   • graphs

4. importate has a limitation and they can not be resized during the execution

5. the proposed article is divided into the following steps:

   • Instrumentation
   • Profiling and analysis
   • Group creation
   • Definition of pool algorithms
   • Mapping into memory resources
   • Simulation and evaluation
   • Deployment.