计算机专业英语郭敏计算机专业英语Unit6章节.pptVIP

Unit 6 Section 2 Passage A algorithm data structure character table list stack queue tree array node LIFO tail Unit 6 Section 2 Passage B linear table Integer direct precursor element direct successor element head rear insertion deletion sequence form chain form pointer reflection Unit 6 Section 2 Passage B Exercises II up accessed removals removed down This implementation stores the list in an array. The Array List has the following properties: ? The position of each element is given by an index from 0 to n-1, where n is the number of elements. ? Given any index, the element with that index can be 1._________ in constant time i.e. the time to access does not depend on the size of the list. ? To add an element at the end of the list, the time taken does not depend on the size of the list. However, the time taken to add an element at any other point in the list does depend on the size of the list, as all subsequent elements must be shifted 2. _________. Additions near the start of the list take longer than additions near the middle or end. ? When an element is 3. _________, subsequent elements must be shifted 4. _________, so removals near the start of the list take longer than 5. _________ near the middle or end. accessed up removed down removals Unit 6 Section 3 Computer English Writing, Part 1 商务电子邮件的写作 一、商务电子邮件的格式 二、商务电子邮件写作的五C原则 Correctness (准确)原则 Conciseness (简洁)原则 Complete (完整)原则 Clarity (清楚)原则 Courtesy (礼貌)原则 Unit 6 Section 4 Tree The Queue ADT 1. Queue Model 2. Array Implementation of Queues Data Warehouse 1．Collecting Operational Data 2．Convergence of Many Computer Technologies 3．Common Characteristics of a Data Warehouse Tips for common PC problems: How to Choose the Proper Data Structure? 在线教务辅导网： 更多课程配套课件资源请访问在线教务辅导网 馋死 PPT研究院 POWERPOINT ACADEMY * * 尚辅网 / Unit 6 Data Structure 《计算机专业英语》 郭敏 徐莹 杨阳 Unit 6 Data Structure Section1 Situational Dialog ACM/ICPC Section 2 Passages Passage A. Data Structure Passage B. Line