Chap1(2010)

A Real-Time Driver’s Direction System
Given an electronic map (stored on a computer), the position of your car (provided by GPS), and the destination, the system can tell you the way to go to the destination. Tell you tern left or right 40 meters before according to the shortest path. If you did not follow the direction, re-calculate the shortest path. 400 US$ each.
Textbook
Introduction to The Design & Analysis of Algorithms (ISBN 01-2003-2170) (清华大学出版社)
References:
T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, The MIT Press. /~clr/
2010-10-23
Central South University
19
3.Electronic commerce
Electronic commerce enables goods and services to be negotiated and exchanged electronically. The ability to keep information such as credit card numbers, passwords, and bank statements private is essential if electronic commerce is to be used widely. Public-key cryptography and digital signatures are among the core technologies used and are based on numerical algorithms and number theory.
2010-10-23 Central South University 2
Why do we use bilingual way to learn this course?
Origin of the modern science English learning Requirement and encouragement coming from our government.
2010-10-23
Central South University
14
Euler Circuit: The original Konigsberg bridge
2010-10-23
Central South University
15
Hamilton Circuit
2010-10-23
Central South University
3. 4.
2010-10-23
Central South University
9
2010-10-23
Central South University
10
2010-10-23
Central South University
11
2010-10-23
Central South University
12
2010-10-23 Central South University 5
B
A
Find a shortest path from station A to station B. -need serious thinking to get a correct algorithm.
2010-10-23 Central South University 6
2010-10-23
Central South University
13
A joke:
The boss wants to produce programs to solve the following two problems Euler circuit problem: given a graph G, find a way to go through each edge exactly once. Hamilton circuit problem: given a graph G, find a way to go through each vertex exactly once. The two problems seem to be very similar. Person A takes the first problem and person B takes the second. Outcome: Person A quickly completes the program, whereas person B works 24 hours per day and is fired after a few months.
Design and Analysis of Algorithms
Jin Zheng
Course Outline
Instructor
Jin Zheng Office number:Computer building 406B,113-2 phone : 88877711 e-mail : zhengjin@
Why You have to 来自ake this course
You can apply learned techniques to solve various problems. Have a sense of complexities of various problems in different domains. College graduates vs. University graduates. Supervisor vs. low level working force.
16
A joke (continued):
Why? no body in the company has taken computer algorithm. Explanation:
Euler circuit problem can be easily solved in polynomial time. Hamilton circuit problem is proved to be NP-hard. So far, no body in the world can give a polynomial time algorithm for a NP-hard problem. Conjecture(推测）: there does not exist polynomial time algorithm for this problem.
2010-10-23 Central South University 17
What kinds of problems are solved by algorithms?
1. The Human Genome Project has the goals of identifying all the 100,000 genes in human DNA, determining the sequences of the 3 billion chemical base pairs that make up human DNA, storing this information in databases, and developing tools for data analysis. Each of these steps requires sophisticated algorithms.
2010-10-23
Central South University
18
2. Internet
The Internet enables people all around the world to quickly access and retrieve large amounts of information. In order to do so, clever algorithms are employed to manage and manipulate this large volume of data. Finding good routes on which the data will travel and using a search engine to quickly find pages on which particular information resides. Such as contral South University 8
What We Cover:
1. 2. Introduce mathematical techniques for the analysis of algorithms. Techniques for designing efficient algorithms Brute force, divide-and-conquer, decrease-and-conquer, transform and conquer greedy approach, dynamic programming , backtracking and branch and bound Some classic algorithms in various domains. Introduction to computational complexity NP-complete problems