Question

Which one is not a dynamic data structure?

• A. Array
• B. Stack
• C. Queue
• D. Linked List

Hint:

The key difference between static and dynamic data structures is memory management. Static structures (like arrays) have a fixed size allocated at compile time, while dynamic structures (like linked lists) can change size at runtime by allocating memory from the heap.

Answer 1

The Correct Option is A

Data structures can be classified as static or dynamic based on their memory allocation.
Static Data Structures: The size of the structure is fixed at compile time and cannot be changed during program execution. Memory is allocated from the stack. A standard Array in languages like C/C++ is a prime example. Its size must be declared beforehand.
Dynamic Data Structures: The size of the structure can grow or shrink during program execution as needed. Memory is typically allocated from the heap.
Let's analyze the options:
(A) Array: A traditional, fixed-size array is a static data structure. Its memory size is determined when it is created and cannot be changed.
(D) Linked List: A classic dynamic data structure. Nodes can be added or removed at runtime, allowing it to grow and shrink.
(B) Stack and (C) Queue: These are abstract data types. They can be implemented using either static arrays or dynamic structures like linked lists. However, they are generally considered dynamic because their primary use case involves changing size. In the context of this question, which contrasts them with a standard array, they are best categorized with dynamic structures.
Therefore, the array is the structure that is not inherently dynamic.