开启掘金成长之旅！这是我参与「掘金日新计划 · 12 月更文挑战」的第21天，点击查看活动详情 以下均介绍在计算机编程时常用的英语，我们都知道编程语言都是英文实现的，掌握这些知识，对打代码和写变量名字和看懂源代码就会事半功倍
1.en前缀
- enqueue (v) - to queue in line. 排隊 ~ 排队
- encode (v) - to convert into a coded form, change sth. into a system secretly. 编码
- encipher (v) - to writing sth. that prevents most people from understanding the message. 密碼；暗號; 加密器
- encrypt (v) - to change electronic information or signals into a secret code. 將…譯成密碼; 把…編碼；把…加密
2.de前缀
- dequeue (v) - to remove from a queue of such items. 出队
- decode (v) - to discover the meaning of information given in a secret or complicated way. 破譯，破解；解（碼）; 解码
- decipher (v) - to discover the meaning of sth. written in a difficult or hidden way, to convert into normal language. 解码
- decrypt (v) - to change electronic information that were written in the form of a secret code. 對（電⼦信息）進⾏解碼，破譯，破
3.primitive
A kind of data structure that comes with a programming language, is built-in
4.cell
The smallest element of memory, which stores one byte of data is a
5.index
A number which identifies an element in an array
6.indices
A rectangular array, (x, y) is described with two numbers, (plural of ‘index’
7.homogeneous
A type of array storing data of the same type is called
8.heterogeneous
A data structure which stores different types of data in the same array is called
9.component
One entry could have several
10.entry
An individual array member, something stored in an array is an
11.hierarchy
12.trees
- parent - Every node, except the root node, has a parent
- child - A node below any particular node is called it’s child node
- siblings - If two child nodes share the same parent node，they're said to be siblings。
- leaf - The node which does not have any child node is called leaf/terminal node.
- Depth − If a binary tree has three levels, we say the tree depth is three
13.过去计算机与现在计算机的对比
14.expansion cards and slot
15.NIC（network interface card）
16.expansion slots
17.slots
18.pins
一些需要注意的概念
1.T
2.T
