資料結構與抽象資料型別：练习题

• a.An ADT is a theoretical model that describes what data can be stored and what operations can be performed, while a data structure is the physical implementation of that model.
• b.An ADT is a built-in language feature like an integer, while a data structure is always user-defined by the programmer.
• c.An ADT is a dynamic storage method that grows at runtime, while a data structure is always a static fixed-size array.
• d.An ADT is the actual code written to store data, while a data structure is the mathematical proof of the algorithm's efficiency.

• a.Memory must be allocated at compile time, leading to wasted space if the structure is under-utilised.
• b.They require additional memory for storing pointers to track the location of data in memory.
• c.The size of the data structure cannot be changed once the program has started execution.
• d.They can only store data of the same type, unlike static arrays which are heterogeneous.

• a.The value associated with the key 'structure' is changed from 2 to 4.
• b.The key 'structure' is removed and replaced by the integer 4.
• c.The frequency of 'data' and 'type' are also incremented by 4.
• d.A new key-value pair \( \text{'structure'}: 4 \) is added, resulting in two 'structure' entries.

• a.A data type described independently of how it is implemented
• b.A static data structure that cannot change size during execution
• c.A physical storage method using pointers and memory addresses
• d.A built-in data type provided by the programming language compiler

• a.

  The size of the structure is fixed at compile time, preventing overflow errors during execution.

• b.

  They do not require the use of pointers or references to link data elements together.

• c.

  They provide faster access times to individual elements because the memory is contiguous.

• d.

  They are more memory efficient as they only allocate memory as required at runtime.

先自己写一遍答案，再对照解题步骤。

先自己写一遍答案，再对照解题步骤。

先自己写一遍答案，再对照解题步骤。

先自己写一遍答案，再对照解题步骤。