网站大量收购闲置独家精品文档,联系QQ:2885784924

[计算机专业英语一.ppt

  1. 1、本文档共30页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
[计算机专业英语一

Computer English Chapter 4 Data Structure Translation [1] Data structures are context-free because they can be used with any type of data and in a variety of situations or contexts. 译文:因为数据结构能用于任何类型的数据,并用于多种环境中,所以数据结构与使用环境无关。 本句中的“because”引导原因状语从句。 [2] General data structure types include the array, the stack, the queue, the tree and so on. 译文:一般的数据结构类型包括数组、堆栈、队列、树等。 本句中的“the array, the file, the record, the table, the tree, and so on”是宾语,其中包含若干项并列部分。 Reading Material —Stacks and Queues The end of a stack at which entries are inserted and deleted is called the top of the stack. The other end is sometimes called the stack’s base. To reflect the fact that access to a stack is restricted to the topmost entry, we use special terminology when referring to the insertion and deletion operations. The process of inserting an object on the stack is called a push operation, and the process of deleting an object is called a pop operation. Thus we speak of pushing an entry onto a stack and popping an entry off a stack. *计算机专业英语 Chapter 4 Data Structure * Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. Key points: useful terms and definitions of data structure Difficult points: Stack, queue, tree Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. Requirements: 1. Three reasons for using data structures are efficiency, abstraction, and reusability. 2. The properties of Stack, Queue, and Tree 3. 掌握常用英汉互译技巧 Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. New Words Expressions: harsh table 杂凑(哈希)表 priority queues 优先队列 reusability n.复用性 binary tree 二叉树 traversing 遍历,走过 context-free 与上下文无关 4.1 An Introduction to Data Structures Evaluation only. Created with Aspose.Slides for .NET 3.5 Client Profile 5.2.0.0. Copyright 2004-2011 Aspose Pty Ltd. Data comes

文档评论(0)

wendan118 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档