1. Well organised data structures allow for quick and efficient _________ of information and are essential for modern computing
2. Well organised data can be easily sorted, ordered, and searched to retrieve information that meets certain requirements.
3. Typical operations on a data structure are: Add, Insert, D_____, First, Next, Last, Locate.
4. This type or category of data structure suggests that the size of the structure is FIXED.
5. This type of data structure is most suited for storing a pre-defined or well defined number of data items.
6. In certain situations the number of items to store is not known before hand. In this case you would use a:
7. In this sort of data structure, the size can grow or shrink depending on the demand for ___________
8. When using a dynamic data structure it is helpful for the programmer to set a ______________ to avoid memory collisions.
9. In a static data structure, memory is allocated at compile time.
10. A static data is sometimes considered inefficient as the amount of memory has been set aside regardless of whether it is needed.
11. A dynamic data structure is ___________________ as the software needs to also keep track of its growing size and data item locations at all times.
12. A dynamic data structure makes the most efficient use of memory as the data structure ____________________________
13. In a dynamic data structure, because the memory allocation is dynamic, it is possible for the structure to ______________ should it exceed its allowed limit.
14. In a dynamic data structure, memory is allocated to the structure dynamically - i.e. as the program actually executes.
15. A stack or queue are generally considered static data structures.
