1. HIT CS&E © DB-LAB (2003) Design and Analysis of Computer Algorithms 骆吉洲计算机科学与工程系

2. HIT CS&E © DB-LAB (2003) 课程介绍

3. HIT CS&E © DB-LAB (2003) Instructor: 骆吉洲Instructor: 骆吉洲 Room: A315Room: A315 Office: 科技大厦， 6011 房间Office: 科技大厦， 6011 房间 Telephone: （ 0451 ） 86415280-20Telephone: （ 0451 ） 86415280-20 Email: luojizhou@hit.edu.cnEmail: luojizhou@hit.edu.cn Information about Instructor

4. HIT CS&E © DB-LAB (2003) Class NewsClass News Will be posted by InternetWill be posted by Internet Please give me your email addressesPlease give me your email addresses Class MaterialsClass Materials You will find them in address:You will find them in address:Http://db.hit.edu.cn/courses Homework and Exam.Homework and Exam. Homework and Reading: 20%Homework and Reading: 20% Final Exam (Written Test): 80%Final Exam (Written Test): 80% Information about Class

5. HIT CS&E © DB-LAB (2003) What to Teach NP P NPO

6. HIT CS&E © DB-LAB (2003) Outline of the course Chapter 1. IntroductionChapter 1. Introduction –1.1 Role of Algorithms in Computer Science –1.2 Algorithms –1.3 Analyzing Algorithms –1.4 Designing Algorithms Chapter 2. Mathematical FoundationsChapter 2. Mathematical Foundations –2.1 Growth of Functions –2.2 Recurrences

7. HIT CS&E © DB-LAB (2003) Chapter 3. Divide-and-conquer Algorithms 3.1 Elements of divide-and-conquer 3.1 Elements of divide-and-conquer 3.2 2-Dimensional Maxima Finding Problem 3.2 2-Dimensional Maxima Finding Problem 3.3 Finding the Closest Pair of Points 3.3 Finding the Closest Pair of Points 3.4 Finding the Convex Hull 3.4 Finding the Convex Hull Chapter 4. Dynamic Programming 4.1 Matrix-chain multiplication 4.1 Matrix-chain multiplication 4.2 Elements of dynamic programming 4.2 Elements of dynamic programming 4.3 Longest common subsequence 4.3 Longest common subsequence 4.4 Optimal polygon triangulation 4.4 Optimal polygon triangulation

8. HIT CS&E © DB-LAB (2003) Chapter 5. Greedy Algorithms 5.1 An activity-selection problem 5.1 An activity-selection problem 5.2 Elements of the greedy strategy 5.2 Elements of the greedy strategy 5.3 Huffman codes 5.3 Huffman codes 5.4 Theoretical foundations for greedy methods 5.4 Theoretical foundations for greedy methods 5.5 A task-scheduling problem 5.5 A task-scheduling problem Chapter 6. Amortized Analysis 6.1 The aggregate method 6.1 The aggregate method 6.2 The accounting method 6.2 The accounting method 6.3 The potential method 6.3 The potential method 6.4 Dynamic tables 6.4 Dynamic tables

9. HIT CS&E © DB-LAB (2003) Chapter 7. Tree Searching StrategiesChapter 7. Tree Searching Strategies –7.1 The Breadth-First Search –7.2 Depth-First Search –7.3 Hill Climbing –7.4 Best-First Search Strategy –7.5 The Branch-and-Bound Strategy Chapter 8. Prune-and-SearchChapter 8. Prune-and-Search –8.1 The General Methods –8.2 The Selection Problem –8.3 Linear Programming with Two Variables –8.4 The 1-Center Problem

10. HIT CS&E © DB-LAB (2003) Chapter 9. On-Line AlgorithmsChapter 9. On-Line Algorithms –9.1 On-Line Euclidean Spanning Tree Algorithm –9.2 On-Line k-Server Problem –9.3 On-Line Obstacle Traversal Algorithm –9.4 Other On-Line Algorithm Chapter 10. Theory of NP-CompletenessChapter 10. Theory of NP-Completeness –10.1 NP Problems –10.2 Cook’s Theorem –10.3 NP-Complete Problems –10.4 NPO Problems

11. HIT CS&E © DB-LAB (2003) Chapter 11. Approximation AlgorithmsChapter 11. Approximation Algorithms –11.1 The vertex-cover problem –11.2 The traveling-salesman problem –11.3 The set-coving problem –11.4 The subset-sum problem Chapter 12. Random AlgorithmsChapter 12. Random Algorithms –12.1 Elements of random algorithms –12.2 Randomized select algorithm –12.3 Randomized QUICKSORT algorithm –12.4 Other randomized algorithms

12. HIT CS&E © DB-LAB (2003) Chapter 12. Genetic AlgorithmsChapter 12. Genetic Algorithms –12.1 The Genetic Algorithms in Problem Solving Problem Solving –12.2 The Genetic Algorithms in Scientific Models Scientific Models –12.3 Theoretical Foundations of Genetic Algorithms Genetic Algorithms

13. HIT CS&E © DB-LAB (2003) References 1. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, Ronald L. Rivest. Introduction to Algorithms, The MIT Press, 第二版, 2002. The MIT Press, 第二版, 2002. 2. 王晓东，计算机算法设计与分析，电子工业出版 社， 2001 。 社， 2001 。

14. HIT CS&E © DB-LAB (2003) Good Books 1. D. E. Knuth 等, Art of the Computer Programming, Vol. 3, Addison-Wesley, 1973. 2. A.V.Aho, J. D. Ullman 等. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. 3. A.V.Aho, J.D.Ullman 等. Data Structures and Algorithms. Addison-Wesley, 1983.4. 3. A.V.Aho, J.D.Ullman 等. Data Structures and Algorithms. Addison-Wesley, 1983.4. 4. S. Baase ， Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, second edition, 1988. 5. E. Horowitz and Sartaj Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978.

15. HIT CS&E © DB-LAB (2003) 1. IEEE Transactions on Electronic Computers 2. IEEE Transactions on Software Engineering 3. IEEE Transactions on Data and Knowledge Engineering Engineering 4. Acta Informatica 5. SIAM Journal on Computing 6. Journal of Computer and System Sciences 7. Communication of the ACM 8. Journal of the ACM 9. BIT Important Journals

16. HIT CS&E © DB-LAB (2003) 10. Information and Control 11. ACM Computing Surveys 12. Mathematics of Computation 13. Information Processing Letters 14. Teoretical Computer Science

17. HIT CS&E © DB-LAB (2003) Important Conferences 1. Annual ACM Symposium on Theory of Computing 2. Annual IEEE Symposium on Foundations of Computer Science Computer Science 3. ACM Annual Computer Science Conference 4. Annual Symposium on Computational Geometry 5. ACM Symposium on Parallel Algorithms and Architectures. Architectures.