Data Structures
数据结构是软件工程专业的核心基础课程，研究数据的逻辑结构、存储结构及相应算法。主要内容包括线性表、栈、队列、串、数组、树与二叉树、图、散列表，以及排序与查找算法。课程强调时间复杂度与空间复杂度分析，培养学生根据实际问题选择合适数据结构的能力，为后续算法设计、操作系统、数据库等课程奠定坚实基础。
Data Structures is a core foundation course in software engineering, covering logical and storage structures of data along with associated algorithms. Topics include lists, stacks, queues, strings, arrays, trees and binary trees, graphs, hash tables, as well as sorting and searching algorithms. The course emphasizes complexity analysis and cultivates the ability to choose appropriate structures for real problems, laying groundwork for algorithms, operating systems, and databases.
学生需设计并实现一个校园地图导航系统，使用图结构存储地点与路径信息。要求实现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.