数据结构

学分：4学分

先修课程：C语言程序设计

课程描述：

本课程主要介绍软件设计中常用的数据结构以及相应的实现算法，如线性表、栈、队列、树和二叉树，图、检索和排序等，并对算法性能进行分析和比较。

课程目标：

本课程的目的是让学生学会分析研究计算机加工的数据结构的特性,以便为应用涉及的数据选择适当的逻辑结构、存储结构及其相应的算法，并初步掌握算法的时间分析和空间分析技术；能熟练使用各种数据结构和算法解决各种实际问题;为后续专业课程的学习以及软件设计打下必要的基础。

成绩评定方式：

评定：学期总评成绩（100％）

重评：补考卷面成绩（100％）

成绩评定要求出勤率

课程教材：

严蔚敏，吴伟民　编著，数据结构（C语言版）附光盘，清华大学出版社，2011.11，讲义随堂提供。

Data Structures

Credits: 4 Credits

Pre-requisite: C Programming

Description：

This course covers some general data structures and algorithms in the design of the software, such as list stack and queue, trees and binary tree, graphs, search and sort etc, and includes the analysis and comparison of the performance of the data structures and the algorithm.

Objective：

The goal of the course is to make students grasp the characteristics of the data structure and help students understand the reasons for choosing structures or algorithms, so as to select the appropriate logical structure, storage structure and the corresponding algorithm for specified application data. The students should learn to analyze the time complexity and space complexity of an algorithm. The students can apply the techniques from the course to solve practical problems. Also the course provides a necessary foundation for following professional courses and software design.

Methods of Summative Assessment：

Assessment: Assessments done during semester (100%)

Reassessment: best of 3 hour resit examination (100%)

Attendance at tutorials is a required element of this module.

Recommended textbooks：

Yan Weimin, Wu Weimin, Data Structures (C language version) with CD, Tsinghua University Press, 2011.11.

Detailed lecture notes will be provided to students