1. Introduction : Problems with large programs 2.The Game of Life (a continuing example) 3. Programming style 4. Coding, Testing ,and Further Refinement 5. Program Maintenance 6. Preview (a) Software Engineering (b) Problem Analysis (c) Requirements Specification (d) Coding 7. Pointers and Pitfalls 8. References

3.1 栈 3.1.1 栈的定义 3.1.2 栈的顺序存储结构及其基本运算实现 3.1.3 栈的链式存储结构及其基本运算的实现 3.2 队列 3.2.1 队列的定义 3.2.2 队列的顺序存储结构及其基本运算的实现 3.2.3 队列的链式存储结构及其基本运算的实现

2.1 线性表的类型定义 2.2 线性表的顺序表示和实现 2.3 线性表的链式表示和实现 2.3.1 线性链表 2.3.2 循环链表 2.3.3 静态链表 2.3.4 动态链表与静态链表 2.3.5 双向链表 2.3.6 其他表示 2.4 基于链表的算法设计 2.5 一元多项式的表示及相加

5.1 数组 5.1.1 数组的基本概念 5.1.2 数组的存储结构 5.1.3 特殊矩阵的压缩存储 5.2 稀疏矩阵 5.2.1 稀疏矩阵的三元组表示 5.2.2 稀疏矩阵的十字链表表示 5.3 递归 5.3.1 递归的定义 5.3.2 何时使用递归 5.3.3 递归算法的设计 5.4 广义表 5.4.1 广义表的定义 5.4.2 广义表的存储结构 5.4.2 广义表的存储结构

Intro Threading Safety Solutions 1 Introduction and expectations Scope : what is parallelism ? Finding parallelism Expectations 2 Threading, theory and practice Processes and threads Python threading C ++threading and async 3 Thread-safety issues Data races Thread safety 4 Thread-safety solutions Avoid the problem Replicate Atomics Locking

1 Measuring Performance What is performance ? Tools available Finding bottlenecks 2 Code modernization 3 Improving Memory Handling Context Containers and memory Container reservation Detecting offending code 4 The nightmare of thread safety Context and constraints Identifying problems Solving problems Thread contention 5 Low level optimizations Scope and target How to measure ? Improving Vectorization promises 6 Conclusion

1 Asynchronous I/O Latency Asynchronous I/O interfaces Message queues 2 I/O optimizations Optimizing network transfers Optimizing local transfers 3 Influence of data structures on I/O Measuring I/O efficiency of algorithms 4 Caching Principles Policies Distributed Caches 5 Conclusion

1 Asynchronous I/O Latency Asynchronous I/O interfaces Message queues 2 I/O optimizations Optimizing network transfers Optimizing local transfers 3 Influence of data structures on I/O Measuring I/O efficiency of algorithms 4 Caching Principles Policies Distributed Caches 5 Conclusion

1 Storage devices Existing devices 2 Parallelizing files’ storage Striping Introduction to Map/Reduce 3 Risks of data loss and corruption 4 Data consistency Checksums Practical usage 5 Data safety Redundancy Parity Erasure coding 6 Conclusion

7.1图的基本概念 7.2图的存储 7.3图的遍历 7.4最小生成树 7.5拓扑排序 7.6关键路径 7.7最短路径