Data Structures and Algorithms
数据结构与算法课程系统讲解线性表、栈、队列、树、图、哈希表等基本数据结构，以及排序、搜索、动态规划、贪心算法、分治法等经典算法。课程注重时间与空间复杂度分析，培养学生高效处理大规模数据的能力，为后续机器学习、数据库系统、大数据处理等课程提供必要的算法基础与编程训练。
This course systematically covers fundamental data structures including lists, stacks, queues, trees, graphs, and hash tables, along with classic algorithms such as sorting, searching, dynamic programming, greedy algorithms, and divide-and-conquer. The course emphasizes time and space complexity analysis, develops the ability to efficiently process large-scale data, and provides essential algorithmic foundations and programming training for machine learning, database systems, and big data processing.
学生需设计并实现一个校园地图导航系统，使用图结构存储地点与路径信息。要求实现Dijkstra与Floyd最短路径算法，支持景点查询、路径规划与最短距离计算。需采用合适的图存储结构，并提供命令行或图形界面。提交可运行程序、源代码及设计文档。
Students design and implement a campus navigation system using a graph to store locations and paths. Requirements include Dijkstra and Floyd shortest path algorithms, landmark query, route planning, and distance calculation. Deliverables include a runnable program, source code, and design documentation with an appropriate graph representation.