《计算机专业英语》Data Structure.pdfVIP

Computer English Chapter 4 Data Structure Key points: Key points: useful terms and definitions useful terms and definitions of data structure of data structure Difficult points: Difficult points: Stack, queue, tree Stack, queue, tree Requirements: Requirements: 1. Three reasons for using data structures are efficiency, abstraction, and reusability. 2. The properties of Stack, Queue, and Tree 3. 掌握常用英汉互译技巧 4.1 An Introduction to Data Structures New Words Expressions: harsh table 杂凑(哈希)表 priority queues 优先队列 reusability n.复用性 binary tree 二叉树 traversing 遍历，走过 context-free 与上下文无关 4.1 An Introduction to Data Structures Data comes in all shapes and sizes, but often it can be organized in the same way. For example, consider a list of things to do, a list of ingredients in a recipe, or a reading list for a class. Although each contains a different type of data, they all contain data organized in a similar way: a list. A list is one simple example of a data structure. Of course, there are many other common ways to organize data as well. In computing, some of the most common organizations are linked lists, stacks, queues, sets, hash tables, trees, heaps, priority queues , and graphs . Three reasons for using data structures are efficiency, abstraction, and reusability. 数据以各种形状和大小出现，但是它常常可以用同样的方式来组织。例如, 考虑要做事情的列表、处方成份的清单或一个班级的阅读目录。虽然它们 包含不同类型的数据,但他们都包含以一种相似方式组织的数据:一个列表。 列表是数据结构的一个简单例子。当然，还有许多其他组织数据通用方法。 在计算机技术中，一些最常用的组织方式是链接表、堆栈、队列、集合、 哈希表、树、堆、优先队列和图。使用数据结构的三个原因是效率、抽象 性和复用性。 4.1 An Introduction to Data Structures Efficiency Data structures organize data in ways that make algorithms more efficient. For example, consider some of the ways we can organize data for searching it. One simplistic approach is to place the data in an array and sear