《计算机专业英语》.ppt
《《计算机专业英语》.ppt》由会员分享,可在线阅读,更多相关《《计算机专业英语》.ppt(135页珍藏版)》请在三一办公上搜索。
1、计算机专业英语,第1篇,计算机专业英语,本课程知识结构,第2篇,第3篇,第4篇,第1篇 基础篇,Chapter 1Architecture of Computer Systems,Text Any discussion of computer architectures,of how computers and computer systems are organized,designed,and implemented,will inevitably make reference to the“von Neumann architecture”as a basis for compariso
2、n,because virtually every electronic computer ever built has been rooted in this architecture.1,第1篇 基础篇,We have strong intuitive feelings about the“von Neumann architecture”,because this is what we have always used.This is“the way computers work”.To comprehend how computer designers conceive,or to a
3、ppreciate what new choices must be found,it is necessary to have a definitive understanding of what the von Neumann architecture is and is not and what its implications are.The von Neumann architecture based on three ideas:four subsystems,stored program concept and sequential execution of instructio
4、ns.2,第1篇 基础篇,Four Subsystems According to Von Neumanns preliminary discussion,the generalpurpose computing machine contains four main“organs”.These are identified as relating to arithmetic,memory,control,and connection with the human operator.In other words,they are the arithmetic logic unit,the con
5、trol unit,the memory,and the inputoutput devices that we see in the classical model of what a computer“looks like”.The control unit(CU),arithmetic logic unit(ALU)and register constitute the central processing unit(CPU),第1篇 基础篇,Four Subsystems According to Von Neumanns preliminary discussion,the gene
6、ralpurpose computing machine contains four main“organs”.These are identified as relating to arithmetic,memory,control,and connection with the human operator.In other words,they are the arithmetic logic unit,the control unit,the memory,and the inputoutput devices that we see in the classical model of
7、 what a computer“looks like”.The control unit(CU),arithmetic logic unit(ALU)and register constitute the central processing unit(CPU),第1篇 基础篇,Stored Program Concept To Von Neumann,the key to building a generalpurpose device lies in its ability to store not only its data and the intermediate results o
8、f computation,but also to store the instructions,or orders,which bring about the computation.3In a generalpurpose one,the instructions must be as changeable as the numbers they acted upon.Therefore,why not encode the instructions into numeric form and store instructions and data in the same memory?V
9、on Neumann proposes that programs and data should be stored in the same binarynumber format in the memory device.4,第1篇 基础篇,Usually,this is viewed as the principal contribution provided by Von Neumanns insight into the nature of what a computer should be,which brings the significant breakthrough in t
10、he development of the generalpurpose electronic computer used today.That is what we all knowthe concept of a stored program.,第1篇 基础篇,Sequential Execution of Instructions Based on the stored program concept,computers store programs and data in a slowtoaccess storage medium(such as a hard disk)and wor
11、k on them in a fastaccess,volatile storage medium(RAM).5However,this concept has a perceived bottleneck:it is designed to process instructions one after another instead of using faster parallel processing.6When the program executes,the message seems to appear all at once,but the speed of the compute
12、r has deceived you.In fact,one instruction executes in sequence,that is at a time:fetching one instruction from memory,interpreting(decoding)it and executing it.The computer does not go on to the next instruction until the one it is working on is completed.,according to 依照architecture 体系结构breakthrou
13、gh 突破constitute 组成decode 译码,解码encode 编码fetch 获取implication 含义instruction 指令intuitive 直觉in sequence 顺次,依次parallel processing 并行处理preliminary 初步的,最初的stored program concept 存储程序概念sequential 顺序的subsystem 子系统,第1篇 基础篇,Key Words&Terms,第1篇 基础篇,Text In computer science,the way information is organized in the
14、 memory of a computer is called a data structure.1 Its a data type whose values are composed of component elements that are related by some structure.Much of programming involves the storage and retrieval of data.Many of the most efficient algorithms for important problems are based on the use of sp
15、ecific data structures;the efficiency of the algorithm depends on the efficiency of the underlying data structure.2Software design often involves the choice of appropriate data structures.,Chapter 2Data Structure,第1篇 基础篇,For example,imagine that you are asked to create a database of names with ABC c
16、ompanys management and employees.To start your work,you make a list of everyone in the company along with their position,as shown in Table 2-1.,第1篇 基础篇,Although this list contains both name and position,it does not tell you which managers are responsible for which workers and so on.If you want your
17、database to represent the relationships between management and employees at ABC,a tree diagram depicted Figure 2-1 is a much better structure for showing the work relationship at ABC.,第1篇 基础篇,These two diagrams are examples of different data structures.If you want to locate the employees record very
18、 quickly,you can use the list that keeps the names of the employees in alphabetical order;If you want to see relationships between employees,the tree structure is much better.There are many different data structures that programmers use to organize data in computers.Each data structure has certain o
19、perations that naturally fit with data structure.Often these operations are bundled with the data structure and together they are called a data type.An example of several common data structures are array,linked list,stack,queue,binary tree,and hash table.,第1篇 基础篇,List A collection of items accessibl
20、e one after another beginning at the head and ending at the tail.,Stack A collection of items in which only the most recently added item may be removed.The latest added item is at the top.Basic operations are push and pop.Also known as“last in,first out”or LIFO.,Queue A collection of items in which
21、only the earliest added item may be accessed.Basic operations are add(to the tail)or enqueue and delete(from the head)or dequeue.Delete returns the item removed.Also known as“first in,first out”or FIFO.,第1篇 基础篇,List A collection of items accessible one after another beginning at the head and ending
22、at the tail.,Stack A collection of items in which only the most recently added item may be removed.The latest added item is at the top.Basic operations are push and pop.Also known as“last in,first out”or LIFO.,Queue A collection of items in which only the earliest added item may be accessed.Basic op
23、erations are add(to the tail)or enqueue and delete(from the head)or dequeue.Delete returns the item removed.Also known as“first in,first out”or FIFO.,第1篇 基础篇,Tree A data structure accessed beginning at the root node.Each node is either a leaf or an internal node.An internal node has one or more chil
24、d nodes and is called the parent of its child nodes.3All children of the same node are siblings.Contrary to a physical tree,the root is usually depicted at the top of the structure,and the leaves are depicted at the bottom.,algorithm 算法alphabetical 按字母顺序的appropriate 适当的array 数组depict 描述dequeue 出队dia
25、gram 图表enqueue 入队hash table 哈希表queue 队列retrieval 检索sibling 兄弟姐妹,同胞stack 堆栈,第1篇 基础篇,Key Words&Terms,FIFO(First In First Out)先进先出FIFO(Last In First Out)后进先出,第1篇 基础篇,Abbreviations,第1篇 基础篇,Chapter 3File Format,Text In general terms,a file format in the PC world signifies what type of information is cont
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 计算机专业英语 计算机专业 英语

链接地址:https://www.31ppt.com/p-5159573.html