Teach students the key ideas and methods of computer algorithms, including four types of resolution routines and eight prime ideas. In this course, many classic problems are specially analysis from the views of principle, implementation, application, etc. Here the C++ programming language is adopted as the default description tool.
Examination information: [time] 2019.06.05 (周三) 14:00-16:00 [location] 3B103
【Introduction】
This course is aimed at graduate students who have learnt some knowledge about data structure and the related basic algorithms. For example, the data stuctures of tree and graph are required to better understand and grasp the pricinples of algorithms. The course teaches students the core ideas of different algoritms and the corresponding design principles. In particular, here C++ is employed to describle the algorithms. Our goal is to train the ability of solving the real-world problems using these algorithms. More specifically, this course would guide students to know the philosophy of different algorithms and their general design routes with aims of enhancing the practicability and applicability. Furthermore, the students are expected to study more in-depth algorithm knowledge after this course.
The teaching method of this course is to concisely explain most important knowledge points of algorithm by introducing theire key features and applicable scenarios. More important, many representative problems would be introduced and analyzed as the examples of certain kind of algorithms. As in most courses, it cannot teach all aspects of algorithms. Alternatively, we choose to only lecture the fundamental algorithms, and thus the teaching contents are organized by their design ideas. When ending this course, the students are expected to skillfully model the real-world problems using an appropriate method and design/implement the concret algorithm to obtain their solutions.
If you have any problems, please contact me via E-mail: zlwang AT ustc DOT edu DOT cn or visit my homepage.
【Supporting】
- The teaching web provided by the author, see details.
- The related teaching resources.
- Reference: “Introduction to Algorithm“.
【Slides】
The following slides are associated with the above textbook. Each set of slides corresponds to a book chapter:
- Ch0: Introduction to Algorithm
- Ch1: Algorithm Analysis
- Ch2: Recursion & Divide and Conquer
- Ch3: Data Structures
- Ch4: Dynamic Programming
- Ch5: Greedy Algorithms
- Ch6: Backtracking
- Ch7: The Branch and Bounding
- Ch8: Stochastic Methods
- Ch9: Linear Programming
- Ch10: Network Flow Algorithms
If you find any mistake or have improvement advise, don’t hesitate to inform me via Email: zlwang AT ustc DOT edu DOT cn.