B2.2.1 Comparing Static and Dynamic Data Structures Notes

Comparing Static and Dynamic Data Structures

Static Data Structures

1. Fixed Size: The size is determined at compile time and cannot be changed during runtime.
2. Memory Allocation: Memory is allocated in a contiguous block, ensuring fast access.
3. Examples: Arrays in Java, tuples in Python.

Dynamic Data Structures

1. Flexible Size: The size can grow or shrink during runtime.
2. Memory Allocation: Memory is allocated and deallocated as needed, often in non-contiguous blocks.
3. Examples: ArrayLists in Java, lists in Python.

Key Differences

1. Memory Management:
   1. Static: Fixed memory allocation.
   2. Dynamic: Flexible memory allocation.
2. Performance:
   1. Static: Faster access due to contiguous memory.
   2. Dynamic: Slightly slower due to potential fragmentation.
3. Flexibility:
   1. Static: Limited by fixed size.
   2. Dynamic: Can adapt to changing data needs.

Advantages and Disadvantages

Static Data Structures

1. Advantages
   1. Speed: Faster access due to contiguous memory.
   2. Simplicity: Easier to implement and manage.
2. Disadvantages
   1. Inflexibility: Cannot change size during runtime.
   2. Memory Waste: Unused memory remains allocated.

Dynamic Data Structures

1. Advantages
   1. Flexibility: Can grow or shrink as needed.
   2. Efficient Memory Use: Allocates only the memory required.
2. Disadvantages
   1. Slower Access: Due to potential memory fragmentation.
   2. Complexity: More complex to implement and manage.

Practical Considerations

1. Flexibility: Use dynamic structures for unknown or variable data sizes.
2. Memory Usage: Static structures may waste memory if over-allocated.
3. Speed: Static structures offer faster access, but dynamic structures provide greater adaptability.