Unit 7 The Fundamentals of computer Software Text 1 data structure A data structure is a data type. Its values are composed of component elements that are elated by some structure Since a data structure is a data type, it has a set of operations on its values. In addition, there may be operations that act on its component elements. The operations of a structured data type might not only act on the values of the data type, they might also act on component elements of the data structure The data type's arrays and records are native to many programming languages. By using the pointer data type and dynamic memory allocation, many programming languages also provide the facilities for constructing linked structures. The first two higher-level abstract data types are stacks and queues. They are extremely important to computing A stack is a data type. Its major attributes are the way the insertion and deletion of its elements. The only element that can be deleted or removed is the one that was inserted most recently. Such a structure is said to have a last-in/first-out(LIFO) behavior Queues are familiar to us. The line of people waiting for service at a bank is an example of queues. The main feature of queues is that they follow a first-come/first-served rule. In queues, the earliest element inserted is the first served. In social settings, the rule appeals to our sense of equality and fairness. There are many applications of the first-in/first-out(FIFO) protocol of queues in computing. For example, the line of 1/O requests waiting for access to a disk drive might be a queue. The line of computing jobs waiting to be run on a computer system might also be a 参考译文 数据结构 数据结构是一种数据类型,其值是由通过某种结构相互关联的组成元素所构成的。 由于数据结构是一种数据类型,因此它有一组针对这些值的操作:而且,可能有一些操 作是作用于其组成元素的。结构化的数据类型的操作不仅可以作用于数据类型的值,并且也 可以作用于数据结构的组成元素 数据类型数组和记录对众多程序设计语言来说都是固有的数据类型。通过使用指针数据 类型和动态存储分配,很多程序设计语言还提供了建立链接结构的功能。我们将要讨论的两 种更高一级的抽象数据类型是堆栈和队列,它们对计算至关重要。 堆栈是一种数据类型,其主要性质是由支配其元素的插入与删除的规则来决定的。 惟一能被删除或移去的元素只能是最后插入的元素,这就是所谓具有后进先出(LIFO) 性质的结构。 队列对我们来说是非常熟悉的。在银行等待服务的一队人,就是队列的一个例子。队列 的主要特征是遵循先来先服务的规则。在队列中,最先插入的元素将最先被服务。这种原则Unit 7 The Fundamentals of Computer Software Text 1 Data Structure A data structure is a data type. Its values are composed of component elements that are related by some structure. Since a data structure is a data type, it has a set of operations on its values. In addition, there may be operations that act on its component elements. The operations of a structured data type might not only act on the values of the data type, they might also act on component elements of the data structure. The data type’s arrays and records are native to many programming languages. By using the pointer data type and dynamic memory allocation, many programming languages also provide the facilities for constructing linked structures. The first two higher-level abstract data types are stacks and queues. They are extremely important to computing. A stack is a data type. Its major attributes are the way the insertion and deletion of its elements. The only element that can be deleted or removed is the one that was inserted most recently. Such a structure is said to have a last-in/first-out (LIFO) behavior. Queues are familiar to us. The line of people waiting for service at a bank is an example of queues. The main feature of queues is that they follow a first-come/first-served rule. In queues, the earliest element inserted is the first served. In social settings, the rule appeals to our sense of equality and fairness. There are many applications of the first-in/first-out (FIFO) protocol of queues in computing. For example, the line of I/O requests waiting for access to a disk drive might be a queue. The line of computing jobs waiting to be run on a computer system might also be a queue. 参考译文 数据结构 数据结构是一种数据类型，其值是由通过某种结构相互关联的组成元素所构成的。 由于数据结构是一种数据类型，因此它有一组针对这些值的操作；而且，可能有一些操 作是作用于其组成元素的。结构化的数据类型的操作不仅可以作用于数据类型的值，并且也 可以作用于数据结构的组成元素。 数据类型数组和记录对众多程序设计语言来说都是固有的数据类型。通过使用指针数据 类型和动态存储分配，很多程序设计语言还提供了建立链接结构的功能。我们将要讨论的两 种更高一级的抽象数据类型是堆栈和队列，它们对计算至关重要。 堆栈是一种数据类型，其主要性质是由支配其元素的插入与删除的规则来决定的。 惟一能被删除或移去的元素只能是最后插入的元素，这就是所谓具有后进先出（LIFO） 性质的结构。 队列对我们来说是非常熟悉的。在银行等待服务的一队人，就是队列的一个例子。队列 的主要特征是遵循先来先服务的规则。在队列中，最先插入的元素将最先被服务。这种原则