计算机专业常用英语_图文_百度文库
两大类热门资源免费畅读
续费一年阅读会员，立省24元！
评价文档：
计算机专业常用英语
上传于||文档简介
&&一​些​计​算​机​专​业​学​生​常​用​的​基​础​英​语​词​汇
大小：1.76MB
登录百度文库，专享文档复制特权，财富值每天免费拿！
你可能喜欢计算机专业英语（Computer English）
计算机专业英语（Computer
Chapter 4 Data Structure
New Words & Expressions
n.行列, 队列; vi.排队
n.自助餐厅 rear
n.后面, 背后, 后方
留出，拨出 head pointer
tail pointer
尾指针 crawl
vi.& n. 爬行, 蠕动, 徐徐行进 egocentric
adj.自我中心的
consumption
n.消费, 消费量 side effect
副作用 migrate
移植; vt.使移居, 使移植
circular queue
vt.想象, 预想 bridge
vt.跨接,接通
In contrast to a stack in which both insertions and deletions are performed at the same end, a queue is a list in which all insertions are performed at one end while all deletions are made at the other. We have already met this structure in relation to waiting lines, where we recognized it as being a first-in, first-out (FIFO) storage system. Actually, the concept of a queue is inherent in any system in which objects are served in the same order in which they arrive. 栈的插入与删除操作都是在表的相同端进行的。而与此不同，队列是插入和删除操作分别在两端进行的表。我们已经遇到过这种与等待队列相关的结构，在此种情况中，我们把它当作是一种先进先出的存储系统。实际上，在那些对象输入与输出顺序相同的系统中，队列的概念是与生俱来的。队列的结尾从等待队列的关联中得到名字。
The ends of a queue get their names from this waiting-line relationship. The end at which entries are removed is called the head (or sometimes the front) of the queue just as we say that the next person to be served in a cafeteria is at the head (or front) of the line. Similarly, the end of the queue at which new entries are added is called the tail (or rear). 结尾处，也就是条目被移出队列的地方，被称为队列的队首（有时候也称为队前），这就好像我们在快餐厅中下一个将点餐的顾客为一队的队首一样。同样，队列的尾部，也就是条目被添加的地方，被称为队尾（或者队后）。
We can implement a queue in a computer's memory within a block of contiguous cells in a way similar to our storage of a stack. Since we need to perform operations at both ends of the structure, we set aside two memory cells to use as pointers instead of just one, as we did for a stack. One of these pointers, called the head pointers keeps track of t the other, called the tail pointer, keeps track of the tail. 我们可以像存储栈那样通过连续单元组成的存储块在计算机主存储器中实现队列。因为我们需要在此结构的两端都进行操作，我们分配出两个存储单元用来当作指针，而非栈中那样仅仅需要一个单元来存储指针。其中的一个指针被称为头指针，用来保持队列头的轨迹；另一个指针被称为尾指针，用来保持队尾的轨迹。
When the queue is empty, both of these pointers point to the same location. Each time an entry is inserted, it is placed in the location pointed to by the tail pointer and then the tail pointer is adjusted to point toward the next unused location. In this manner, the tail pointer is always pointing to the first vacancy at the tail of the queue. Removing an entry from the queue involves extracting the entry pointed to by the head pointer and then adjusting the head pointer to point toward the entry that followed the removed entry. 如果一个队列为空，那么两个指针应该指向相同的位置。每当新的条目被插入时，均会被置于尾指针所指向的位置，同时修改尾指针，使之指向下一个未使用的位置。这样，尾指针总是指向队尾后的第一空闲存储单元。将一条数据移出队列的操作包括将头指针指向的条目取出，同时调整头指针使之指向排在被移出条目之后的位置 。
A problem remains with the storage system as described thus far. If left unchecked, the queue crawls slowly through memory like a glacier, destroying any other data in its path (Figure 4.2). This movement is the result of the rather egocentric policy of inserting each new entry by merely placing it next to the previous one and repositioning the tail pointer accordingly. If we add enough entries, the tail of the queue ultimately extends all the way to the end of the machine's memory. 以上描述的存储系统仍然存在着问题。如果剩余的存储器未被检查，队列会像冰河一样在存储器中增长，同时将在此道路上的所有其他数据破坏（如图所示）。造成这种移动的相当一部分原因在于插入新条目时使用的“利己”策略，即在插入是仅仅将新数据置于当前队尾之后，同时重置尾指针。如果我们添加足够的条目，那么队尾最后就会从计算机存储器中溢出。
This consumption of memory is not the result of the queue's size but is a side effect of the queue's access procedure. (A small yet active queue can easily require more of a machine's memory resources than a large, inactive one.) One solution to this memory space problem might be to move the entries in a queue forward as the leading ones are removed, in the same manner as people waiting to buy theater tickets step forward each time a person has been served. However, this mass movement of data would be very inefficient. What we need is a way of confining the queue to one area of memory without being forced to perform major rearrangements of data. 存储器的消耗问题并不是因队列的大小而生的，其真正原因在于队列的实现问题。（一个小而动态变化的队列比一个大而保持不变的队列需要更多的机器存储资源。）解决存储器空间问题的一个可能方法是：当最前面的条目被移出时,前移队列中的其他条目，就好像人们在购买戏票时所采用的方法一样，每当一个人买到票后，就前移一人。然而这种方法在计算机中运行的效率很低，因为它将需要对数据进行大量的移动。
A common solution is to set aside a block of memory for the queue, start the queue at one end of the block, and let the queue migrate toward the other end of the block. Then, when the tail of the queue reaches the end of the block, we merely start inserting additional entries back at the original end of the block, which by this time is vacant. Likewise, when the last entry in the block finally becomes the head of the queue and is removed, the head pointer is adjusted back to the beginning of the block where other entries are, by this time, waiting. In this manner, the queue chases itself around within the block rather than wandering off through memory. 用来在计算机中控制队列的最一般的方法是为队列分配一块存储器，从存储块的末端开始存储队列，并且让队列向另一端增长。然而当队尾到达块的末端，即队列为空时，我们开始将新的条目反向于末端的方向插入。同样，当队列的最后一条成为队头并被移出时，调整头指针回到块的开端，同时在此等待。在此方法下，队列在一块区域内循环而不会出现内存溢出情况。
Such a technique results in an implementation that is called a circular queue because the effect is that of forming a loop out of the block of memory cells allotted to the queue. As far as the queue is concerned, the last cell in the block is adjacent to the first cell. 采用此技术的实现方法称为循环队列，因为分配给队列的一块存储单元组成了一个环。就一个队列而言，存储块的最后一个单元与它的第一个单元相邻。
Once again, we should recognize the difference between the conceptual structure envisioned by the user of a queue and the actual cyclic structure implemented in the machine's memory. As in the case of the previous structures, these differences are normally bridged by software. That is along with the collection of memory cells used for data storage, a queue implementation should include a collection of procedures that insert and remove entries from the queue as well as detect whether the queue is empty or full. 我们应该再次认识到队列使用者使用的概念结构与实际在计算机存储器中实现的循环结构之间的差异。在前一个结构的例子中，这些差异通常是通过软件来衔接的。也就是说，连同存储数据需要的一组存储单元，队列的实现应该包括一组用来插入和移出队列条目和探测队列是否为空或满的过程函数。然后，开发软件其他单元的程序员可以通过这些方法来实现队列的插入和移出操作，而不用关心其在存储器中的实际实现。
常用英汉互译技巧
一、增译法
根据英汉两种语言不同的思维方式、语言习惯和表达方式，在翻译时增添一些词、短句或句子，以便更准确地表达出原文所包含的意义。这种方式多半用在汉译英里。 1、汉语无主句较多，而英语句子一般都要有主语，所以在翻译汉语无主句的时候，除了少数可用英语无主句、被动语态或“There be…”结构来翻译以外，一般都要根据语境补出主语，使句子完整。 2、英汉两种语言在名词、代词、连词、介词和冠词的使用方法上也存在很大差别。英语中代词使用频率较高，凡说到人的器官和归某人所有的或与某人有关的事物时，必须在前面加上物主代词。因此，在汉译英时需要增补物主代词，而在英译汉时又需要根据情况适当地删减。 3、英语词与词、词组与词组以及句子与句子的逻辑关系一般用连词来表示，而汉语则往往通过上下文和语序来表示这种关系。因此，在汉译英时常常需要增补连词。英语句子离不开介词和冠词。 4、在汉译英时还要注意增补一些原文中暗含而没有明言的词语和一些概括性、注释性的词语，以确保译文意思的完整。
例1. Indeed, the reverse is true
实际情况恰好相反。（增译名词） 例2. 这是这两代计算机之间的又一个共同点。
This is yet another common point between the computers of the two generations.（增译介词） 例3.
Individual mathematicians often have their own way of pronouncing mathematical expressions and in many cases there is no generally accepted “correct” pronunciation.
每个数学家对数学公式常常有各自的读法，在许多情况下，并不存在一个普遍接受的所谓“正确”读法。(增加隐含意义的词) 例4.
只有在可能发生混淆、或要强调其观点时，数学家才使用较长的读法
It is only when confusion may occur, or where he/she wishes to emphasis the point, that the mathematician will use the longer forms. (增加主语)
二、省译法
这是与增译法相对应的一种翻译方法，即删去不符合目标语思维习惯、语言习惯和表达方式的词，以避免译文累赘。增译法的例句反之即可。又如： 例1. You will be staying in this hotel during your visit in Beijing. 你在北京访问期间就住在这家饭店里。（省译物主代词） 例2. I hope you will enjoy your stay here. 希望您在这儿过得愉快。（省译主语） 例3. 中国政府历来重视环境保护工作。 The Chinese government has always attached great importance to environmental protection. (省译名词) 例4.
The development of IC made it possible for electronic devices to become smaller and smaller. 集成电路的发展是电子器件可以做得越来越小。(省译形式主语it)
三、转换法
在翻译过程中，为了使译文符合目标语的表述方式、方法和习惯，对原句中的词类、句型和语态等进行转换： 1、在词性方面，把名词转换为代词、形容词、动词；把动词转换成名词、形容词、副词、介词；把形容词转换成副词和短语。 2、在句子成分方面，把主语变成状语、定语、宾语、表语；把谓语变成主语、定语、表语；把定语变成状语、主语；把宾语变成主语。 3、在句型方面，把并列句变成复合句，把复合句变成并列句，把状语从句变成定语从句。 4、在语态方面，可以把主动语态变为被动语态。
三、转换法
例1. Too much exposure to TV programs will do great harm to the eyesight of children. 孩子们看电视过多会大大地损坏视力。(名词转动词) 例2. 由于我们实行了改革开放政策，我国的综合国力有了明显的增强。 Thanks to the introduction of our reform and opening policy, our comprehensive national strength has greatly improved. (动词转名词) 例3. 时间不早了，我们回去吧！ We don’t have much time left. Let’s go back. (句型转换)
四、拆句法和合并法
Increased cooperation with China is in the interests of the United States. 同中国加强合作，符合美国的利益。（在主谓连接处拆译） 例3.
中国是个大国，百分之八十的人口从事农业，但耕地只占土地面积的十分之一，其余为山脉、森林、城镇和其他用地。 China is a large country with four-fifths of the population engaged in agriculture, but only one tenth of the land is farmland, the rest being mountains, forests and places for urban and other uses.（合译法） 例4.
Packet switching is a method of slicing digital messages into parcels called “packets,” sending the packets along different communication paths as they become available, and then reassembling the packets once they arrive at their destination. 分组交换是传输数据的一种方法，它先将数据信息分割成许多称为“分组”的数据信息包；当路径可用时，经过不同的通信路径发送；当到达目的地后，再将它们组装起来。(将长定语从句拆成几个并列的分句)
五、正译法和反译法
这两种方法通常用于汉译英，偶尔也用于英译汉。所谓正译，是指把句子按照与汉语相同的语序或表达方式译成英语。所谓反译则是指把句子按照与汉语相反的语序或表达方式译成英语。正译与反译常常具有同义的效果，但反译往往更符合英语的思维方式和表达习惯。因此比较地道 。
你可以从因特网上获得这一信息。 You can obtain this information on the Internet. （正译） This information is accessible/available on the Internet. （反译） 例2.
他突然想到了一个新主意。 Suddenly he had a new idea. (正译) He suddenly thought out a new idea. (正译) A new idea suddenly occurred to/struck him. （反译）
六、倒置法
在汉语中，定语修饰语和状语修饰语往往位于被修饰语之前；在英语中，许多修饰语常常位于被修饰语之后，因此翻译时往往要把原文的语序颠倒过来。倒置法通常用于英译汉, 即对英语长句按照汉语的习惯表达法进行前后调换，按意群或进行全部倒置，原则是使汉语译句安排符合现代汉语论理叙事的一般逻辑顺序。有时倒置法也用于汉译英。如： 例1.
At this moment, through the wonder of telecommunications, more people are seeing and hearing what we say than on any other occasions in the whole history of the world. 此时此刻，通过现代通信手段的奇迹，看到和听到我们讲话的人比整个世界历史上任何其他这样的场合都要多。（部分倒置） 例2.
改革开放以来，中国发生了巨大的变化。 Great changes have taken place in China since the introduction of the reform and opening policy.(全部倒置)
七、包孕法
这种方法多用于英译汉。所谓包孕是指在把英语长句译成汉语时，把英语后置成分按照汉语的正常语序放在中心词之前，使修饰成分在汉语句中形成前置包孕。但修饰成分不宜过长，否则会形成拖沓或造成汉语句子成分在连接上的纠葛。如： 例1.
IP multicasting is a set of technologies that enables efficient delivery of data to many locations on a network. IP多信道广播是使数据向网络中许多位置高效传送的一组技术。 例2.
What brings us together is that we have common interests which transcend those differences.
使我们走到一起的，是我们有超越这些分歧的共同利益.
八、插入法
指把难以处理的句子成分用破折号、括号或前后逗号插入译句中。这种方法主要用于笔译中。偶尔也用于口译中，即用同位语、插入语或定语从句来处理一些解释性成分。 如：如果说宣布收回香港就会像夫人说的“带来灾难性的影响”，那我们将勇敢地面对这个灾难，做出决策。 If the announcement of the recovery of Hong Kong would bring about, as Madam put it, “disastrous effects,” we will face that disaster squarely and make a new policy decision.
九、重组法
在进行英译汉时，为了使译文流畅和更符合汉语叙事论理的习惯，在捋清英语长句的结构、弄懂英语原意的基础上，彻底摆脱原文语序和句子形式，对句子进行重新组合。 如：Decision must
physical endurance is tested as much as perception, because an enormous amount of time must be spent making certain that the key figures act on the basis of the same information and purpose. 必须把大量时间花在确保关键人物均根据同一情报和目的行事，而这一切对身体的耐力和思维能力都是一大考验。因此，一旦考虑成熟，决策者就应迅速做出决策。
十、综合法
指把难以处理的句子成分用破折号、括号或前后逗号插入译句中。这种方法主要用于笔译中。偶尔也用于口译中，即用同位语、插入语或定语从句来处理一些解释性成分。 如： 如果说宣布收回香港就会像夫人说的“带来灾难性的影响”，那我们将勇敢地面对这个灾难，做出决策。 If the announcement of the recovery of Hong Kong would bring about, as Madam put it, “disastrous effects,” we will face that disaster squarely and make a new policy decision.
是指单用某种翻译技巧无法译出时，着眼篇章，以逻辑分析为基础，同时使用转换法、倒置法、增译法、省译法、拆句法等多种翻译技巧的方法。 如： Behind this formal definition are three extremely important concepts that are the basis for understanding the Internet: packet switching, the TCP/IP communications protocol, and client/server computing.
在这个正式的定义背后，隐含着三个极其重要的概念：分组交换、TCP/IP(传输控制协议/网际协议)通信协议和客户机/服务器计算技术，它们乃是理解因特网的基础。推荐这篇日记的豆列
······滑动查看详情
全新正版图书
在线支付运费10元
由思诺华教图书专营店发货并提供售后服务
支持7天无理由退货
您已经点赞过了