@[English Interview, Important Vocabularies, 计算机, 外企面试, 专业词汇]
| 单词 | 音标 | 意思 |
|---|---|---|
| product | [ˈprɑdʌkt] | 乘积 |
| palindrome | [ˈpælɪndroʊm] | 回文 |
| ascending | [əˈsɛndɪŋ] | 升序 |
| descending | [dɪ'sendɪŋ] | 降序 |
| exclusive-or | [ɪkˈsklusɪv] | XOR 异或 |
| bit manipulation | [mə.nɪpjə'leɪʃ(ə)n] | 位操作 |
| carry | [ˈkæri] | 进位 |
| congruence formula | [ˈkɑŋɡruəns, kənˈɡru-] [ˈfɔrmjələ] | 同余式 |
| allocate | ['ælə.keɪt] | 分配 |
| binary tree | 二叉树 | |
| multi-tree | 多叉树 | |
| circular queue | ['sɜrkjələr] | 循环队列 |
| complement | ['kɑmplə.ment] | 补码、余角 |
| portability | [.pɔrtə'bɪləti] | 可移植性 |
| traversing | ['træ.vɜrs] | 遍历 |
| dictionaries | 字典 | |
| heap | 堆 | |
| Priority queue | 优先队列 | |
| Matrix multiplication | 矩阵乘法 | |
| Greedy algorithm | 贪心算法 | |
| Upper bound / Lower bound | 上界/下界 | |
| Best case /Worst Case/ Average case | 最好情况/最坏情况/平均情况 | |
| Insertion sort | 插入排序 | |
| Merge sort | 合并排序 | |
| Heap sort | 堆排序 | |
| Quick sort | 快排 | |
| DP (Dynamic Programming) | 动态规划 | |
| Knapsack problem | ['næp.sæk] | 背包问题 |
| Huffman Coding | 哈弗曼编码 | |
| Dijkstra’s algorithm | 迪杰斯特拉算法 | |
| Bellman-Ford algorithm | 贝尔曼-福德算法 | |
| Floyd-Warshall algorithm | 弗洛伊德算法 | |
| Back-Tracking | 回溯 | |
| N-Queen problem | N皇后问题 | |
| Linear programming | 线性规划 | |
| Random number generation | 随机数生成 | |
| Generating graphs | 图的生成 | |
| Graph Problems – polynomial algorithm | [.pɑli'noʊmiəl] | 图论-多项式算法 |
| Connected components | 连通分支 | |
| Minimum Spanning Tree | ['mɪnɪməm] | 最小生成树 |
| Shortest path | 最短路径 | |
| Non-Deterministic Polynomial problem | [dɪˌtɜːmɪ'nɪstɪk] | NP问题 |
| Traveling salesman problem | 旅行商问题 | |
| Graph isomorphism | [ˌaɪsəʊ'mɔːfɪzəm] | 同构 |
| Text compression | 压缩 | |
| Longest Common Substring | ['sʌbstrɪŋ] | 最长公共子串 |
| Shortest Common Superstring | 最短公共父串 | |
| Rate of convergence | [kən'vɜrdʒəns] | 收敛速度 |
| Set Data Structures | 集合 | |
| Linear Equations | 线性方程组 | |
| Data abstraction | 数据抽象 | |
| Data element | 数据元素 | |
| Data object | 数据对象 | |
| Data type | 数据类型 | |
| Logical structure | 逻辑结构 | |
| Physical structure | 物理结构 | |
| Linear structure / Nonlinear structure | 线性结构/非线性结构 | |
| Linear list | 线性表 | |
| Stack | 栈 | |
| Queue | 队列 | |
| String | 串 | |
| Graph | 图 | |
| Insertion | [ɪn'sɜrʃ(ə)n] | 插入 |
| Deletion | 删除 | |
| Predecessor | ['predə.sesər] | 前趋 |
| Successor | [sək'sesər] | 后继 |
| Immediate predecessor | 直接前趋 | |
| Immediate successor | 直接后继 | |
| Double-ended queue | 双端列表 | |
| circular queue | ['sɜrkjələr] | 循环队列 |
| Pointer | 指针 | |
| First-in first-out list | 先进先出表（队列） | |
| Last-in first-out list | 后进先出表（队列） | |
| Bottom / Top | 栈底/栈顶 | |
| Push / Pop | 压入/弹出 | |
| Front / Rear | 队头/队尾 | |
| Overflow/ Underflow | 上溢/下溢 | |
| Matrix | 矩阵 | |
| array | [ə'reɪ] | 数组 |
| Multi-dimensional array | 多维数组 | |
| Row major order / Column major order | 以行为主/以列为主的顺序分配 | |
| Triangular matrix | [traɪ'æŋɡjələr] | 三角矩阵 |
| Symmetric matrix | [sɪ'metrɪk] | 对称矩阵 |
| Sparse matrix | 稀疏矩阵 | |
| Transposed matrix | [træns'poʊz] | 转置矩阵 |
| Linked list | 链表 | |
| Linear linked list | 线性链表 | |
| Single linked list | 单链表 | |
| Multilinked list | 多重链表 | |
| Circular linked list | 循环链表 | |
| Doubly linked list | 双向链表 | |
| Orthogonal list | [ɔr'θɒgənəl] | 十字链表 |
| Generalized list | 广义表 | |
| Pointer field | 指针域 | |
| Head node | 头结点 | |
| Head pointer / Tail pointer | 头指针/尾指针 | |
| Blank string | 空白串 | |
| Null string | [nʌl] | 空串（零串） |
| Substring | ['sʌbstrɪŋ] | 子串 |
| Subtree | 子树 | |
| Forest | 森林 | |
| Root | 根 | |
| Leaf | 叶子 | |
| Depth | [depθ] | 深度 |
| Parents/ Children/ Brother/ Ancestor/ Descendant | ['æn.sestər] [dɪ'sendənt] | 双亲/孩子/兄弟/祖先/子孙 |
| Balanced binary tree | 平衡二叉树 | |
| Full binary tree | 满二叉树 | |
| Complete binary tree | 完全二叉树 | |
| Traversing binary tree | 遍历二叉树 | |
| Binary sort tree | 二叉排序树 | |
| Binary search tree | 二叉查找树 | |
| Threaded binary tree | [θred] | 线索二叉树 |
| Ordered tree / Unordered tree | 有序树/无序树 | |
| Decision tree | 判定树 | |
| Digital search tree | 数字查找树 | |
| Preorder traversal | [pri:'ɔ:də] | 先序遍历 |
| Inorder traversal | [ɪ'nɔrdər] | 中序遍历 |
| Postorder traversal | 后序遍历 | |
| Subgraph | 子图 | |
| Digraph(directed graph)/Undigraph(undirected graph) | ['daɪgrɑ:f] | 有向图/无向图 |
| Complete graph | 完全图 | |
| Connected graph | 连通图 | |
| Unconnected graph | 非连通图 | |
| Strongly connected graph | 强连通图 | |
| Weakly connected graph | 弱连通图 | |
| Directed acyclic graph | [ˌeɪ'saɪklɪk] | |
| Biconnected graph | 重连通图 | |
| Bipartite graph | [.baɪ'pɑr.taɪt] | 二部图 |
| Edge | 边 | |
| Vertex | ['vɜr.teks] | 顶点 |
| Articulation point | [ɑr.tɪkju'leɪʃ(ə)n] | 连接点 |
| Initial node | 初始结点 | |
| Terminal node | ['tɜrmɪn(ə)l] | 终端结点 |
| Adjacent edge | [ə'dʒeɪs(ə)nt] | 相邻边 |
| Adjacent vertex | 相邻顶点 | |
| Incident edge | ['ɪnsɪdənt] | 关联边 |
| In-degree/ Out-degree | 入度/出度 | |
| Ordered pair/ Unordered pair | 有序对/无序对 | |
| Simple path | 简单路径 | |
| Simple cycle | 简单回路 | |
| Connected component | 连通分量 | |
| Adjacency matrix | 邻接矩阵 | |
| Adjacency list | 邻接表 | |
| Adjacency multi-list | 邻接多重表 | |
| Traversing graph | 遍历图 | |
| Spanning tree | [spæn] | 生成树 |
| Topological sort | [tɒpə'lɒdʒɪkəl] | 拓扑排序 |
| Partial order | [ˈpɑːrʃ(ə)l] | 偏序 |
| Critical path | ['krɪtɪk(ə)l] | 关键路径 |
| Linear search (Sequential search) | [sɪ'kwenʃ(ə)l] | 线性查找（顺序查找） |
| Binary search | 二分查找 | |
| Block search | 分块查找 | |
| Hash search | 散列查找 | |
| Average search length | 平均查找长度 | |
| Hash table | 散列表 | |
| Hash function | 散列函数 | |
| Random number method | 随机数法 | |
| Internal sort | 内部排序 | |
| External sort | 外部排序 | |
| Selection sort | 选择排序 | |
| Radix sort | ['reɪdɪks] | 基数排序 |
| Balance merging sort | 平衡归并排序 | |
| Indexed file | ['ɪndekst] | 索引文件 |
| Inverted file | [ɪnˈvɜrt] | 倒排文件 |