东北大学：某学院计算机科学与技术专业《数据结构》课程教学大纲

数据结构教学大纲Data Structures Subject Syllabus一，课程信息SubjectInformation课程编号：开课学期：33100212005SemesterSubject ID课程分类：所属课群：专业教育PA专业基础MFCategorySection课程学分：总学时/周：724.5Credit PointsTotal Hours/Weeks理论学时：实验学时：5616LECT. HoursEXP. HoursPBL学时:实践学时/周：00PBL HoursPRAC. Hours/Weeks东北大学悉尼智能科技学院开课学院：Sydney Smart适用专业：计算机科学与技术CSTCollegeTechnology CollegeStreamNortheasternUniversity课程属性：课程模式：必修Compulsory互认EQVPatternMode沈哲中方课程协调人：成绩记载方式：百分制MarksNEU CoordinatorShen ZheResult Type先修课程：C++程序设计基础RequisitesFundamentals of C++ Programming英文参考教材：Mark Allen Weiss.,Data Structures andAlgorithmAnalysis inC,ENTextbooksSecondEdition，机械工业出版社，2010中文参考教材：严蔚敏，吴伟民编著，数据结构（C语言版），清华大学出版社，2018CN Textbooks教学资源：http://www.cppreference.com/Resourceshttp://www.cplusplus.com/课程负责人(撰写人)：沈哲提交日期：单击或点击此处输Shen ZheSubject DirectorSubmitted Date入日期。沈哲任课教师(含负责人)：Shen ZheTaught by审核人：批准人：韩鹏史闻博Checked byApproved by批准日期：单击或点击此处输入日期。Approved Date1 / 13

1 / 13 数据结构 教学大纲 Data Structures Subject Syllabus 一、课程信息 Subject Information 课程编号: Subject ID 3100212005 开课学期: Semester 3 课程分类: Category 专业教育 PA 所属课群: Section 专业基础 MF 课程学分: Credit Points 4.5 总学时/周: Total Hours/Weeks 72 理论学时: LECT. Hours 56 实验学时: EXP. Hours 16 PBL 学时: PBL Hours 0 实践学时/周: PRAC. Hours/Weeks 0 开课学院: College 东北大学 悉尼智能科技学院 Sydney Smart Technology College Northeastern University 适用专业: Stream 计算机科学与技术 CST 课程属性: Pattern 必修 Compulsory 课程模式: Mode 互认 EQV 中方课程协调人: NEU Coordinator 沈哲 Shen Zhe 成绩记载方式: Result Type 百分制 Marks 先修课程: Requisites C++程序设计基础 Fundamentals of C++ Programming 英文参考教材: EN Textbooks Mark Allen Weiss., Data Structures and Algorithm Analysis in C, Second Edition, 机械工业出版社, 2010 中文参考教材: CN Textbooks 严蔚敏，吴伟民 编著，数据结构（C 语言版），清华大学出版社， 2018 教学资源: Resources http://www.cppreference.com/ http://www.cplusplus.com/ 课程负责人(撰写人): Subject Director 沈哲 Shen Zhe 提交日期: Submitted Date 单击或点击此处输 入日期。 任课教师(含负责人): Taught by 沈哲 Shen Zhe 审核人: Checked by 韩鹏 批准人: Approved by 史闻博 批准日期: Approved Date 单击或点击此处输 入日期

二、教学目标SubjectLearningObjectives(SLOs)注：毕业要求及指标点可参照悉尼学院本科生培养方案，可根据实际情况增减行数Note: GA and index can be referred from undergraduate program in SSTC website. Please add/reduce lines based on subject使用计算机来解决实际问题时，涉及到数据的表示及数据的处理，而数据表示及数据处理正是数据结构课程的主要研究对象，通过这两方面内容的学习，为后续课程打下厚实的知识基础，同时也提供了必要的技能训练。为此，本课程通过课堂教学和上机实习，使学生了解数据组织的基本方法，具备分析和解决现实问题在计算机中如何表示和处理的能力并培养良好的程序设计技能，以便为数据选择适当的逻辑、存储结构及相应算法，了解对算法的时间和空间分析方法。本课程在基础方面，要求学生掌握常用数据结构的基本概念及其不同的实现方法：在技能方面，通过系统学习能够在不同存储结构上实现不同的运算，并掌握算法设计的方式和技巧。Whenusingcomputertosolvepracticalproblems,itinvolvesdatarepresentation and data processing.Data representation and data整体目标：processing are the main research objects of data structure courseOverall ObjectiveThrough the study of these two aspects, it lays a solid knowledgefoundation for the follow-up courses and provides necessary skillstraining.Therefore,through classroom teaching and computer practice,studentscan understand the basic methods of data organization, have the abilityto analyze and solve practical problems in the computer and cultivategood programming skills,so astoselecttheappropriatelogic,storagestructure and corresponding algorithms for data,and understand thetime and space analysis methods ofthe algorithmIn thebasic aspect,students are required to master the basic concepts ofcommon data structureand their different implementation methods; Interms of skills, different operations can be realized in different storagestructures through system learning, and the design methods and skills ofthealgorithmcanbemastered理解常用的算法度量方法，包括时间复杂度和空间复杂度。1-1Understand common algorithm metrics,including timecomplexityandspacecomplexity理解抽象数据类型的定义和功能作用。1-2Understand the definition and function of abstract data types.掌握常用数据结构的定义、操作及实现，包括线性表、栈（1）专业目标：队列、树、图等。Professional Ability1-3Master the definition, operation and implementation ofcommon data structure, including linear list, stack, queue, treegraph,etc.掌握常用排序方法，能够根据需求实现合理的排序方式。1-4Masterthecommon sortingmethods,andbeabletoachieveareasonable sorting method accordingto theneeds2 / 13

2 / 13 二、教学目标 Subject Learning Objectives (SLOs) 注：毕业要求及指标点可参照悉尼学院本科生培养方案，可根据实际情况增减行数 Note: GA and index can be referred from undergraduate program in SSTC website. Please add/reduce lines based on subject. 整体目标: Overall Objective 使用计算机来解决实际问题时，涉及到数据的表示及数据的处理， 而数据表示及数据处理正是数据结构课程的主要研究对象，通过这 两方面内容的学习，为后续课程打下厚实的知识基础，同时也提供 了必要的技能训练。 为此，本课程通过课堂教学和上机实习，使学生了解数据组织的基 本方法，具备分析和解决现实问题在计算机中如何表示和处理的能 力并培养良好的程序设计技能，以便为数据选择适当的逻辑、存储 结构及相应算法，了解对算法的时间和空间分析方法。 本课程在基础方面，要求学生掌握常用数据结构的基本概念及其不 同的实现方法；在技能方面，通过系统学习能够在不同存储结构上 实现不同的运算，并掌握算法设计的方式和技巧。 When using computer to solve practical problems, it involves data representation and data processing. Data representation and data processing are the main research objects of data structure course. Through the study of these two aspects, it lays a solid knowledge foundation for the follow-up courses and provides necessary skills training. Therefore, through classroom teaching and computer practice, students can understand the basic methods of data organization, have the ability to analyze and solve practical problems in the computer and cultivate good programming skills, so as to select the appropriate logic, storage structure and corresponding algorithms for data, and understand the time and space analysis methods of the algorithm. In the basic aspect, students are required to master the basic concepts of common data structure and their different implementation methods; In terms of skills, different operations can be realized in different storage structures through system learning, and the design methods and skills of the algorithm can be mastered. （1）专业目标: Professional Ability 1-1 理解常用的算法度量方法，包括时间复杂度和空间复杂度。 Understand common algorithm metrics, including time complexity and space complexity. 1-2 理解抽象数据类型的定义和功能作用。 Understand the definition and function of abstract data types. 1-3 掌握常用数据结构的定义、操作及实现，包括线性表、栈、 队列、树、图等。 Master the definition, operation and implementation of common data structure, including linear list, stack, queue, tree, graph, etc. 1-4 掌握常用排序方法，能够根据需求实现合理的排序方式。 Master the common sorting methods, and be able to achieve a reasonable sorting method according to the needs

明确掌握数据结构与算法对计算机程序设计的重要意义及发展趋势。2-1The significance and development trend of mastering datastructure and algorithm for computer program design are clear（2）德育目标：数据结构与算法强调逻辑分析与实践相结合，理论联系实EssentialQuality际，保证基础软件安全稳定，实现知行合一。Data structure and algorithm emphasize the combination of2-2logical analysis and practice, theory with practice,ensure thesecurity and stability of basic software, realize the unity ofknowledge and practice课程教学目标与毕业要求的对应关系MatrixofGA&SLOs毕业要求GA教学目标SLOs指标点GAIndex指标点1-2：掌握程序设计、数据结构、算法分析与设计、计算机数字系统、操1、工程知识：能够将数学、作系统等专业知识，具备计算机程序设自然科学、工程基础和专业计开发能力和计算机与信息系统设计开知识用于解决复杂工程间发与维护能力题。GA1.Engineering1-2: Mastery of programming, data1-1, 1-2, 1-3,1-4,Knowledge:Apply knowledgestructure, algorithms analysis and design,2-2ofmathematics, naturalcomputer digital system, and operatingscience,engineeringfundamentalsandansystem,etc.,andcapableofcomputerengineering specialization toprogramming and design, design andthesolutionof complexengineering problemsmaintenanceofcomputerandinformationsystems,3、设计/开发解决方案：能指标点3-1：能够设计针对本专业相关复够设计针对复杂工程问题的杂工程问题的解决方案，能够设计和开解决方案，设计满足特定需发实现特定功能、满足特定需求的计算求的系统、单元或流程，并机、软件或网络系统。能够在设计环节中体现创新3-1:Capable of designing solutions to意识，考虑社会、健康、安complex engineering problems related to1-3,1-4全、法律、文化以及环境等the major, and capable of designing and因素。developingcomputers,softwareorDesign/DevelopmentofnetworksystemstthatcanfunctionspecificallyandspecificSolutions: Design solutionsmeetforcomplexengineeringrequirements.指标点3-3：能够在设计和开发的各个环problems and design systems,节中综合考虑社会、健康、安全、法律、components or processesthatmeet specified needs with文化以及环境等因素。appropriate consideration for2-23-3:Capable of taking social, health,public health, and safety,safety,legal, cultural and environmentalandcultural,societalfactors in consideration during all aspectsenvironmental considerations. of design and development3/13

3 / 13 （2）德育目标: Essential Quality 2-1 明确掌握数据结构与算法对计算机程序设计的重要意义及 发展趋势。 The significance and development trend of mastering data structure and algorithm for computer program design are clear. 2-2 数据结构与算法强调逻辑分析与实践相结合，理论联系实 际，保证基础软件安全稳定，实现知行合一。 Data structure and algorithm emphasize the combination of logical analysis and practice, theory with practice, ensure the security and stability of basic software, realize the unity of knowledge and practice. 课程教学目标与毕业要求的对应关系 Matrix of GA & SLOs 毕业要求 GA 指标点 GA Index 教学目标 SLOs 1、工程知识：能够将数学、 自然科学、工程基础和专业 知识用于解决复杂工程问 题。 GA1. Engineering Knowledge: Apply knowledge of mathematics, natural science, engineering fundamentals and an engineering specialization to the solution of complex engineering problems. 指标点 1-2：掌握程序设计、数据结构、 算法分析与设计、计算机数字系统、操 作系统等专业知识，具备计算机程序设 计开发能力和计算机与信息系统设计开 发与维护能力； 1-2: Mastery of programming, data structure, algorithms analysis and design, computer digital system, and operating system, etc., and capable of computer programming and design, design and maintenance of computer and information systems; 1-1，1-2，1-3,1-4， 2-2 3、设计/开发解决方案：能 够设计针对复杂工程问题的 解决方案，设计满足特定需 求的系统、单元或流程，并 能够在设计环节中体现创新 意识，考虑社会、健康、安 全、法律、文化以及环境等 因素。 Design/Development of Solutions: Design solutions for complex engineering problems and design systems, components or processes that meet specified needs with appropriate consideration for public health, and safety, cultural, societal and environmental considerations. 指标点 3-1：能够设计针对本专业相关复 杂工程问题的解决方案，能够设计和开 发实现特定功能、满足特定需求的计算 机、软件或网络系统。 3-1: Capable of designing solutions to complex engineering problems related to the major, and capable of designing and developing computers, software or network systems that can function specifically and meet specific requirements. 1-3，1-4 指标点 3-3：能够在设计和开发的各个环 节中综合考虑社会、健康、安全、法律、 文化以及环境等因素。 3-3: Capable of taking social, health, safety, legal, cultural and environmental factors in consideration during all aspects of design and development. 2-2

4、研究：能够基于科学原理并采用科学方法对复杂工程问题进行研究，包括设计实验、分析与解释数据、并通过信息综合得到合理有效的指标点4-3：能够追踪国际前沿技术动结论。态，掌握本专业涉及的重要技术指标以Investigation:Conduct及达到指标所需的技术途径。complexinvestigationsofCapableof trackingtheinternational2-1, 2-2problemsusingcutting-edge technology trends, master theresearch-basedknowledgeimportant technical indicators involved inandmethodsresearchthe major and the technical approachesincludingdesignofneeded to achieve the indicators.andexperiments,analysisdata,andinterpretationofsynthesis of information toprovide valid conclusions三、教学内容Content(Topics)注：以中英文填写，各部分内容的表格可根据实际知识单元数量进行复制、扩展或缩减Note: Filled in both CN and EN,extend or reduce based on the actual numbers ofknowledge unit(1)理论教学 Lecture知识单元序号支撑教学目标11-1,2-1,2-2Knowledge Unit No.SLOs Supported知识单元名称数据结构与算法简介IntroductionofdatastructureandalgorithmUnit Title数据结构的概念Theconceptofdatastructure数据结构的历史与发展Thehistoryanddevelopmentofdata知识点：structureKnowledge Delivery算法的概念Theconceptofalgorithm算法的度量Measurement of algorithm数据结构与算法的发展了解：The history and development of data structure andRecognizealgorithm.学习目标：理解：数据结构与算法的概念UnderstandLearning ObjectivesTheconceptofdata structure and algorithm算法的度量方法，包括时间复杂度和空间复杂度掌握：Themeasurementmethodofthealgorithm,includesMastertimecomplexityand spacecomplexity德育目标2-1, 2-2Moral Objectives重点：数据结构与算法的概念Key PointsThe concept of data structure and algorithm4/13

4 / 13 4、研究：能够基于科学原理 并采用科学方法对复杂工程 问题进行研究，包括设计实 验、分析与解释数据、并通 过信息综合得到合理有效的 结论。 Investigation: Conduct investigations of complex problems using research-based knowledge and research methods including design of experiments, analysis and interpretation of data, and synthesis of information to provide valid conclusions. 指标点 4-3：能够追踪国际前沿技术动 态，掌握本专业涉及的重要技术指标以 及达到指标所需的技术途径。 Capable of tracking the international cutting-edge technology trends, master the important technical indicators involved in the major and the technical approaches needed to achieve the indicators. 2-1，2-2 三、教学内容 Content (Topics) 注：以中英文填写，各部分内容的表格可根据实际知识单元数量进行复制、扩展或缩减 Note: Filled in both CN and EN, extend or reduce based on the actual numbers of knowledge unit (1) 理论教学 Lecture 知识单元序号: Knowledge Unit No. 1 支撑教学目标: SLOs Supported 1-1，2-1，2-2 知识单元名称 Unit Title 数据结构与算法简介 Introduction of data structure and algorithm. 知识点: Knowledge Delivery 数据结构的概念 The concept of data structure. 数据结构的历史与发展 The history and development of data structure. 算法的概念 The concept of algorithm. 算法的度量 Measurement of algorithm. 学习目标: Learning Objectives 了解: Recognize 数据结构与算法的发展 The history and development of data structure and algorithm. 理解: Understand 数据结构与算法的概念 The concept of data structure and algorithm. 掌握: Master 算法的度量方法，包括时间复杂度和空间复杂度 The measurement method of the algorithm， includes time complexity and space complexity. 德育目标 Moral Objectives 2-1, 2-2 重点: Key Points 数据结构与算法的概念 The concept of data structure and algorithm

算法的度量方法，包括时间复杂度和空间复杂度难点：The measurement method of the algorithm,includes time complexityFocal pointsand spacecomplexity知识单元序号支撑教学目标：21-2, 1-4Knowledge Unit No.SLOs Supported知识单元名称线性表Linear ListUnit Title线性表的定义The definition of linear list线性表的应用Theapplicationof linear list知识点：线性表的抽象数据类型Abstractdatatypeof linearlist.Knowledge Delivery线性表的概念与逻辑结构和存储结构The concept, logicalstructure and storage structure of linear list.了解：线性表的概念RecognizeThe concept of linear list.学习目标：理解：线性表的抽象数据类型Learning ObjectivesUnderstandThe abstract data type of linear list.掌握：线性表的逻辑结构和存储结构MasterThe logical structure and storage structure of linear list.德育目标2-1, 2-2Moral Objectives重点：线性表的抽象数据类型Key PointsThe abstract data type of linear list.难点：线性表的逻辑结构和存储结构Focal pointsThe logical structure and storage structure of linear list知识单元序号：支撑教学目标：31-2,1-3,1-4Knowledge Unit No.SLOs Supported知识单元名称栈与队列Queueand StackUnit Title栈与队列的定义Thedefinition ofqueue and stack栈与队列的特征Thecharacteristics ofqueueand stack知识点：栈与队列的抽象数据类型Knowledge DeliveryTheabstractdata type of queue and stack栈与队列的逻辑结构与存储结构The logical structure and storage structure of queue and stack了解：栈与队列的定义ThedefinitionofqueueandstackRecognize学习目标：理解：栈与队列的特征Learning ObjectivesUnderstandThe characteristics of queue and stack掌握：栈与队列的逻辑结构与存储结构ThelogicalMasterstructureandstoragestructureofqueueandstack德育目标2-1, 2-2Moral Objectives5/13

5 / 13 难点: Focal points 算法的度量方法，包括时间复杂度和空间复杂度 The measurement method of the algorithm， includes time complexity and space complexity. 知识单元序号: Knowledge Unit No. 2 支撑教学目标: SLOs Supported 1-2，1-4 知识单元名称 Unit Title 线性表 Linear List 知识点: Knowledge Delivery 线性表的定义 The definition of linear list. 线性表的应用 The application of linear list. 线性表的抽象数据类型 Abstract data type of linear list. 线性表的概念与逻辑结构和存储结构 The concept, logical structure and storage structure of linear list. 学习目标: Learning Objectives 了解: Recognize 线性表的概念 The concept of linear list. 理解: Understand 线性表的抽象数据类型 The abstract data type of linear list. 掌握: Master 线性表的逻辑结构和存储结构 The logical structure and storage structure of linear list. 德育目标 Moral Objectives 2-1, 2-2 重点: Key Points 线性表的抽象数据类型 The abstract data type of linear list. 难点: Focal points 线性表的逻辑结构和存储结构 The logical structure and storage structure of linear list. 知识单元序号: Knowledge Unit No. 3 支撑教学目标: SLOs Supported 1-2，1-3，1-4 知识单元名称 Unit Title 栈与队列 Queue and Stack 知识点: Knowledge Delivery 栈与队列的定义 The definition of queue and stack. 栈与队列的特征 The characteristics of queue and stack. 栈与队列的抽象数据类型 The abstract data type of queue and stack. 栈与队列的逻辑结构与存储结构 The logical structure and storage structure of queue and stack. 学习目标: Learning Objectives 了解: Recognize 栈与队列的定义 The definition of queue and stack. 理解: Understand 栈与队列的特征 The characteristics of queue and stack. 掌握: Master 栈 与队列的 逻辑结构 与存 储结构 The logical structure and storage structure of queue and stack. 德育目标 Moral Objectives 2-1, 2-2

重点：栈与队列的逻辑结构与存储结构The logical structure and storageKey Pointsstructure of queue and stack.难点：栈与队列的特征Thecharacteristics ofqueue and stack.Focal points支撑教学目标：知识单元序号41-2,1-3,1-4Knowledge Unit No.SLOs Supported知识单元名称树TreeUnit Title树的定义Thedefinition of tree.树的特征Thecharacteristicsoftree知识点：树的抽象数据类型TheabstractdatatypeoftreeKnowledge Delivery树的逻辑结构与存储结构The logical structure and storage structure of tree.了解：树的定义ThedefinitionoftreeRecognize学习目标：理解：树的特征ThecharacteristicsoftreeUnderstandLearning Objectives掌握：树的逻辑结构与存储结构MasterThe logical structure and storage structure of tree德育目标2-1, 2-2Moral Objectives重点：树的逻辑结构与存储结构Key PointsThe logical structure and storage structure of tree.难点：树的特征The characteristics oftreeFocal points知识单元序号支撑教学目标51-2, 1-3, 1-4Knowledge Unit No.SLOs Supported知识单元名称图 GraphUnit Title图的定义The definition of graph.图的特征The characteristics of graph知识点图的抽象数据类型TheabstractdatatypeofgraphKnowledge Delivery图的逻辑结构与存储结构The logical structure and storage structure of graph了解：图的定义RecognizeThe definition of graph学习目标：理解：图的特征Learning ObjectivesUnderstandThe characteristics of graph.掌握：图的逻辑结构与存储结构MasterThe logical structureand storage structure of graph德育目标2-1, 2-2Moral Objectives6 / 13

6 / 13 重点: Key Points 栈与队列的逻辑结构与存储结构 The logical structure and storage structure of queue and stack. 难点: Focal points 栈与队列的特征 The characteristics of queue and stack. 知识单元序号: Knowledge Unit No. 4 支撑教学目标: SLOs Supported 1-2，1-3，1-4 知识单元名称 Unit Title 树 Tree 知识点: Knowledge Delivery 树的定义 The definition of tree. 树的特征 The characteristics of tree. 树的抽象数据类型 The abstract data type of tree. 树的逻辑结构与存储结构 The logical structure and storage structure of tree. 学习目标: Learning Objectives 了解: Recognize 树的定义 The definition of tree. 理解: Understand 树的特征 The characteristics of tree. 掌握: Master 树的逻辑结构与存储结构 The logical structure and storage structure of tree. 德育目标 Moral Objectives 2-1, 2-2 重点: Key Points 树的逻辑结构与存储结构 The logical structure and storage structure of tree. 难点: Focal points 树的特征 The characteristics of tree. 知识单元序号: Knowledge Unit No. 5 支撑教学目标: SLOs Supported 1-2，1-3，1-4 知识单元名称 Unit Title 图 Graph 知识点: Knowledge Delivery 图的定义 The definition of graph. 图的特征 The characteristics of graph. 图的抽象数据类型 The abstract data type of graph. 图的逻辑结构与存储结构 The logical structure and storage structure of graph. 学习目标: Learning Objectives 了解: Recognize 图的定义 The definition of graph. 理解: Understand 图的特征 The characteristics of graph. 掌握: Master 图的逻辑结构与存储结构 The logical structure and storage structure of graph. 德育目标 Moral Objectives 2-1, 2-2

重点：图的逻辑结构与存储结构Key PointsThe logical structure and storage structure of graph难点：图的特征Focal pointsThecharacteristics ofgraph支撑教学目标：知识单元序号61-2,1-3,1-4Knowledge Unit No.SLOs Supported知识单元名称排序SortingUnit Title排序的定义Thedefinitionof sroting.排序的应用Theapplicationofsorting知识点：常用排序算法CommonsortingalgorithmKnowledge Delivery常用排序算法时间复杂度Timecomplexityofcommon sortingalgorithms.了解：排序的定义RecognizeThe definition of sroting学习目标：理解：常用排序算法时间复杂度UnderstandLearning ObjectivesTimecomplexityofcommonsortingalgorithms掌握：常用排序算法MasterCommon sorting algorithm德育目标2-1, 2-2Moral Objectives重点：常用排序算法Key PointsCommon sorting algorithm.难点：常用排序算法时间复杂度Focal pointsTime complexity of common sorting algorithms(2）实验教学Experiments注：可根据实际情况增减行数。实验类型可分为验证性、设计性、综合性，实验性质可分为选做、必做。Note: Please add/reduce lines based on subject. The Type contains Verify, Design, and Comprehensive, while the Pattemcontains Required and Elective序号学时实验项目名称每组人数实验类型实验性质No.MPG*TypeExperiment TopicHoursPattern线性表的应用设计性必做112Application of linear listDesignElec栈的应用必做设计性212ElecApplication of stackDesign队列的应用设计性必做321Application of queueDesignElec树的应用设计性必做314Application of treeDesignElec531图的应用设计性必做7/ 13

7 / 13 重点: Key Points 图的逻辑结构与存储结构 The logical structure and storage structure of graph. 难点: Focal points 图的特征 The characteristics of graph. 知识单元序号: Knowledge Unit No. 6 支撑教学目标: SLOs Supported 1-2，1-3，1-4 知识单元名称 Unit Title 排序 Sorting 知识点: Knowledge Delivery 排序的定义 The definition of sroting. 排序的应用 The application of sorting. 常用排序算法 Common sorting algorithm. 常用排序算法时间复杂度 Time complexity of common sorting algorithms. 学习目标: Learning Objectives 了解: Recognize 排序的定义 The definition of sroting. 理解: Understand 常用排序算法时间复杂度 Time complexity of common sorting algorithms. 掌握: Master 常用排序算法 Common sorting algorithm. 德育目标 Moral Objectives 2-1, 2-2 重点: Key Points 常用排序算法 Common sorting algorithm. 难点: Focal points 常用排序算法时间复杂度 Time complexity of common sorting algorithms. (2) 实验教学 Experiments 注：可根据实际情况增减行数。实验类型可分为验证性、设计性、综合性，实验性质可分为选做、必做。 Note: Please add/reduce lines based on subject. The Type contains Verify, Design, and Comprehensive, while the Pattern contains Required and Elective 序号 No. 实验项目名称 Experiment Topic 学时 Hours 每组人数 MPG* 实验类型 Type 实验性质 Pattern 1 线性表的应用 Application of linear list 2 1 设计性 Design 必做 Elec 2 栈的应用 Application of stack 2 1 设计性 Design 必做 Elec 3 队列的应用 Application of queue 2 1 设计性 Design 必做 Elec 4 树的应用 Application of tree 3 1 设计性 Design 必做 Elec 5 图的应用 3 1 设计性 必做

ElecApplicationofgraphDesign综合性必做排序算法461SortingElecComp总计Total16*MPG: Members per group支撑教学目标：实验项目序号：11-2, 1-3Experiment No.SLOs Supported李佳音每组成员：指导教师：1TutorLi JiayinMembers per Group实验名称线性表的应用Experiment TitleApplication of linear list实验内容：线性表的插入与删除ContentInsert and delete element in linear list.学习目标：熟悉线性表的基本操作Learning ObjectivesMasterthebasicoperation of linearlist.能够实现线性表的创建、销毁、插入、删除等常用操作。教学要求Realizethe creation,destroy,insertion,deletion and other commonRequirementsoperationsof lineartable实验场地综合楼1209，ZongheBuilding120gLocation实验软硬件设备台式计算机PersonalComputerSoftware/Hardware实验项目序号：支撑教学目标：21-2, 1-3Experiment No.SLOs Supported每组成员：李佳音指导教师：1Members per GroupTutorLiJiayin实验名称：栈的应用Experiment TitleApplicationofstack实验内容：栈的出栈与入栈ContentPush and pop in stack.学习目标：熟悉栈的基本操作Learning ObjectivesMasterthebasicoperationof stack能够实现栈的创建、销毁、出栈、入栈等常用操作。教学要求：Realizethecreation,destroy,push,popandothercommonoperationsRequirementsof stack.8/13

8 / 13 Application of graph Design Elec 6 排序算法 Sorting 4 1 综合性 Comp 必做 Elec 总计 Total 16 *MPG: Members per group 实验项目序号: Experiment No. 1 支撑教学目标: SLOs Supported 1-2, 1-3 每组成员: Members per Group 1 指导教师: Tutor 李佳音 Li Jiayin 实验名称: Experiment Title 线性表的应用 Application of linear list 实验内容: Content 线性表的插入与删除 Insert and delete element in linear list. 学习目标: Learning Objectives 熟悉线性表的基本操作 Master the basic operation of linear list. 教学要求: Requirements 能够实现线性表的创建、销毁、插入、删除等常用操作。 Realize the creation, destroy, insertion, deletion and other common operations of linear table. 实验场地: Location 综合楼 1209， Zonghe Building 1209 实验软硬件设备: Software/Hardware 台式计算机 Personal Computer 实验项目序号: Experiment No. 2 支撑教学目标: SLOs Supported 1-2, 1-3 每组成员: Members per Group 1 指导教师: Tutor 李佳音 Li Jiayin 实验名称: Experiment Title 栈的应用 Application of stack 实验内容: Content 栈的出栈与入栈 Push and pop in stack. 学习目标: Learning Objectives 熟悉栈的基本操作 Master the basic operation of stack. 教学要求: Requirements 能够实现栈的创建、销毁、出栈、入栈等常用操作。 Realize the creation, destroy, push, pop and other common operations of stack

实验场地：综合楼1209，ZongheBuilding1209Location实验软硬件设备台式计算机PersonalComputerSoftware/Hardware实验项目序号：支撑教学目标：31-2, 1-3Experiment NoSLOs Supported每组成员：指导教师：李佳音1TutorLi JiayinMembers perGroup实验名称：队列的应用Experiment TitleApplication of queue实验内容：元素的入队与出队操作ContentAelement join in and leavefrom queue学习目标：熟悉队列的基本操作Learning ObjectivesMasterthebasicoperation of queue能够实现队列的创建、销毁、出队、入队等常用操作。教学要求：Realizethecreation,destroy,join,leaveandother commonoperationsRequirementsof queue.实验场地：综合楼1209，ZongheBuilding1209Location实验软硬件设备台式计算机PersonalComputerSoftware/Hardware实验项目序号：支撑教学目标：41-2, 1-3, 1-4SLOs SupportedExperiment No.每组成员：李佳音指导教师：1TutorMembers per GroupLi Jiayin树的应用实验名称：Experiment TitleApplicationoftree实验内容：树的遍历ContentTraverse of tree学习目标：熟悉树的基本操作Learning ObjectivesMaster the basic operation of tree能够实现树的创建、销毁、插入、删除、遍历等常用操作。教学要求Realize the creation,destruction, insert, delete,traverseand otherRequirementscommonoperationsof tree实验场地：综合楼1209，ZongheBuilding1209Location9 /13

9 / 13 实验场地: Location 综合楼 1209， Zonghe Building 1209 实验软硬件设备: Software/Hardware 台式计算机 Personal Computer 实验项目序号: Experiment No. 3 支撑教学目标: SLOs Supported 1-2, 1-3 每组成员: Members per Group 1 指导教师: Tutor 李佳音 Li Jiayin 实验名称: Experiment Title 队列的应用 Application of queue 实验内容: Content 元素的入队与出队操作 A element join in and leave from queue. 学习目标: Learning Objectives 熟悉队列的基本操作 Master the basic operation of queue. 教学要求: Requirements 能够实现队列的创建、销毁、出队、入队等常用操作。 Realize the creation, destroy, join, leave and other common operations of queue. 实验场地: Location 综合楼 1209， Zonghe Building 1209 实验软硬件设备: Software/Hardware 台式计算机 Personal Computer 实验项目序号: Experiment No. 4 支撑教学目标: SLOs Supported 1-2, 1-3, 1-4 每组成员: Members per Group 1 指导教师: Tutor 李佳音 Li Jiayin 实验名称: Experiment Title 树的应用 Application of tree 实验内容: Content 树的遍历 Traverse of tree. 学习目标: Learning Objectives 熟悉树的基本操作 Master the basic operation of tree. 教学要求: Requirements 能够实现树的创建、销毁、插入、删除、遍历等常用操作。 Realize the creation, destruction, insert, delete, traverse and other common operations of tree. 实验场地: Location 综合楼 1209， Zonghe Building 1209

实验软硬件设备台式计算机PersonalComputerSoftware/Hardware实验项目序号：支撑教学目标：51-2, 1-3, 1-4Experiment NoSLOs Supported李佳音每组成员：指导教师：1TutorMembers per GroupLi Jiayin实验名称：图的应用Experiment TitleApplication of graph实验内容：图的插入删除与遍历ContentElement insert delete and traverse in graph学习目标：熟悉图的基本操作Masterthebasicoperationofgraph.Learning Objectives能够实现图的存储、插入、删除、遍历等常用操作。教学要求：Realize the storage,insertion,deletion,traverseandother commonRequirementsoperations of graph实验场地：综合楼1209，ZongheBuilding1209Location实验软硬件设备：台式计算机PersonalComputerSoftware/Hardware实验项目序号：支撑教学目标：61-2, 1-3, 1-4Experiment NoSLOs Supported每组成员：指导教师：李佳音1TutorLi JiayinMembers per Group排序实验名称SortingExperiment Title实验内容：冒泡排序与归并排序ContentBubble sort and merge sort.学习目标：掌握常用的排序方法Learning ObjectivesMasterthecommonsortingmethods教学要求能够实现规定时间复杂度的排序算法。RequirementsA sorting algorithm with specified timecomplexity can be realized.实验场地：综合楼1209，ZongheBuilding1209Location实验软硬件设备：台式计算机PersonalComputerSoftware/Hardware10/13

10 / 13 实验软硬件设备: Software/Hardware 台式计算机 Personal Computer 实验项目序号: Experiment No. 5 支撑教学目标: SLOs Supported 1-2, 1-3, 1-4 每组成员: Members per Group 1 指导教师: Tutor 李佳音 Li Jiayin 实验名称: Experiment Title 图的应用 Application of graph 实验内容: Content 图的插入删除与遍历 Element insert delete and traverse in graph. 学习目标: Learning Objectives 熟悉图的基本操作 Master the basic operation of graph. 教学要求: Requirements 能够实现图的存储、插入、删除、遍历等常用操作。 Realize the storage, insertion, deletion，traverse and other common operations of graph. 实验场地: Location 综合楼 1209， Zonghe Building 1209 实验软硬件设备: Software/Hardware 台式计算机 Personal Computer 实验项目序号: Experiment No. 6 支撑教学目标: SLOs Supported 1-2, 1-3, 1-4 每组成员: Members per Group 1 指导教师: Tutor 李佳音 Li Jiayin 实验名称: Experiment Title 排序 Sorting 实验内容: Content 冒泡排序与归并排序 Bubble sort and merge sort. 学习目标: Learning Objectives 掌握常用的排序方法 Master the common sorting methods. 教学要求: Requirements 能够实现规定时间复杂度的排序算法。 A sorting algorithm with specified time complexity can be realized. 实验场地: Location 综合楼 1209， Zonghe Building 1209 实验软硬件设备: Software/Hardware 台式计算机 Personal Computer