本课程介绍数据结构与算法的基础性内容，主要包括算法分析方法、基础数据结构、排序算法、树与图的算法、算法设计思想和NP完全性问题等。要求学生掌握算法计算复杂性分析的基本方法（含递归分析和递延分析方法）；掌握课程所涵盖的算法，并且能够转化为相应的实现代码；当同一问题有多种可供选择的算法时，能够分析各种算法之间的不同之处，并且为特定问题选择最适合的算法；理解分而治之法、动态规划法和贪婪算法三种算法设计思想的基本原理和异同；了解NP完全性问题，能够识别实现应用中出现的典型NP完全性问题以其变形。除课堂讲解外，课程通过实验和项目让学生巩固和运用课堂上所学的知识。

This course provides a comprehensive introduction to the modern study of computer algorithms and data structures. It presents many data structures and algorithms and covers them in considerable depth, yet makes their design and analysis accessible to different levels of students. These topics include: algorithm analysis and recurrences, divide and conquer, elementary data structures, sorting algorithms, hash tables, binary search trees, dynamic programming, greedy algorithms, graph algorithms, and string matching. It discusses implementation concerns and engineering issues in algorithm design, as well as mathematical aspects.