Static and dynamic Data Structures

What is a key characteristic of static data structures?

• They can grow or shrink in size during program execution.

• Memory can be reallocated as required while the program is running.

• The maximum size needs to be known in advance.

• They make efficient use of memory by only using what's needed.

Which statement accurately describes dynamic data structures?

• Their size is fixed in the code and cannot change during runtime.

• Memory for them is set aside at the start of the program and might not be fully utilized.

• A programmer has control over exactly how much memory will be used.

• They are generally easier to program because there's no need to check their size.

What is an advantage of dynamic data structures?

• Memory allocation is fixed, which means there will be no issues with adding and removing items.

• They are easier to program because there is no need to check the size of the data structure.

• They make efficient use of memory because they only use as much memory as needed.

• They run the risk of overflow if they exceed their allowed limit.

What characteristic defines a static data structure?

• Its size can be changed at runtime.

• Its structure and data can be changed at runtime.

• Its size cannot be changed at runtime.

• Its structure and data cannot be changed at runtime.