《数据结构大作业》教学大纲

课程代码

045101681

课程名称

数据结构大作业

英文名称

Project of Data Structures

课程类别

集中实践课

课程性质

必修

学时

总学时:1周 :实验学时: 1

学分

1.0

开课学期

第四学期

开课单位

计算机科学与工程学院

适用专业

计算机科学与技术、网络工程、信息安全

授课语言

中文

先修课程

数据结构

课程对毕业要求的支撑

 №3.设计/开发解决方案:能够设计针对复杂网络工程问题的解决方案,包括满足特定需求的系统设计、部件选择、工程实施流程或方案设计,并能够在设计环节中体现创新意识,考虑社会、健康、安全、法律、文化以及环境等因素。

 №5.使用现代工具:能够针对复杂网络工程问题,开发、选择与使用恰当的技术、资源、现代工程工具和信息技术工具,包括对复杂工程问题的预测与模拟,并能够理解其局限性。

 №9.个人和团队:能够在多学科背景下的团队中承担个体、团队成员以及负责人的角色。

 №10.沟通:能够就复杂网络工程问题与业界同行及社会公众进行有效沟通和交流,包括撰写报告和设计文稿、陈述发言、清晰表达或回应指令。并具备一定的国际视野,能够在跨文化背景下进行沟通和交流。

 №11.项目管理:理解并掌握工程管理原理与经济决策方法,并能在多学科环境中应用。


课程目标

完成课程后,学生将具备以下能力:

  1. 能够灵活应用数据结构知识,对现实中的工程问题进行分析,对适用的数据结构以及算法进行对比论证。

  2. 能够设计针对计算机工程复杂问题的解决方案,设计满足特定需求的数据结构和算法,并能够在设计环节中体现创新意识。具有较复杂计算机系统研发基本能力,具备问题分析和建模的能力。

课程简介

数据结构大作业是对数据结构设计和运用的综合训练,包括问题分析、总体设计、用户界面设计、程序设计基本技能和技巧,软件规范和科学作风的培养。相比数据结构实验中完成的单一而“小”的算法,本课程设计着重训练学生对问题的分析能力以及对复杂数据结构和算法的运用能力。

教学内容与学时分配

  1. 课程答辩                       1



实验教学(包括上机学时、实验学时、实践学时)

  1. 课程答辩                       1


教学方法

实验教学。以作业的形式发布教学内容。同学们通过自由组队的形式,在课后完成实验,并撰写报告,以小组为单位进行集中答辩。

考核方式

答辩成绩占60%

书面大作业报告占40%

教材及参考书

 [1] Clifford A. Shaffer, “A Practical Introduction to Data Structures and Algorithm Analysis (2nd edition)”, Publishing House of Electronics Industry (Chinese Publisher), 2009

[2] Adam Drozdek, “Data Structures and Algorithms in C++ (2nd edition)”, Brooks/Cole, 2001

[3] Nell Dale, “C++ Data Structures (3rd edition)”, Jones and Bartlett Publishers, Inc, 2003

 [4]严蔚敏,吴伟民,数据结构(C语言版),清华大学出版社,20037月再版;

 [5]肖南峰,赵洁,数据结构与算法设计,电子工业出版社,200612月出版;

[6] 傅清祥,王晓东,算法与数据结构,电子工业出版社,2001

[7] 吴文虎,王建德,实用算法的分析与程序设计,电子工业出版社,1998

[8] William F.William T.Data Structures with C++Prentice HallInc.1996

制定人及制定时间

吕建明 2019415

 “Data Structures” Syllabus

Course Code

045101681

Course Title

Project of Data Structures

Course Category

Practice Course

Course Nature

Compulsory Course

Class Hours

1 weeks

Credits

1.0

Semester

4rdsemester

Institute

School of Computer Science and Engineering

Program Oriented

Computer Science and Technology, Network Engineering, Information Security

Teaching Language

Chinese

Prerequisites

Data Structures

 Student Outcomes

 (Special Training Ability)

3. Design / Development Solutions: An ability to design solutions for complex network engineering problems, including system design, component selection, engineering implementation process or solution design to satisfy specific needs, and an ability to exhibit innovative awareness in the design process, considering factors such as society, health, security, law, culture, and environment.

5. Applying Modern Tools: An ability to develop, select and apply appropriate techniques, resources, and modern engineering and IT tools for complex network engineering problems, including prediction and modeling of complex engineering problems with an understanding of the limitations.

9. Individual and Team: An ability to function effectively as an individual, and as a member or leader in multi-disciplinary teams.

10. Communication: An ability to communicate effectively on complex network engineering problems with the engineering community and with society at large, which includes the ability to write reports and design documentation, make presentations, clearly present or respond to instructions, and possess a certain degree of global horizon, being able to conduct communication in the cross-cultural contexts.

11.Project Management: Understanding and mastering engineering management principles and methods of economic decision-making, and applying them to multidisciplinary environments.


Course Objectives

After the course, the students will enhance their ability in the following aspects:

1. Students can use the data structure knowledge flexibly for the engineering problems in real world, and do comparison among different data structures.

2. Students can design the data structures and algorithms to address the specific demands from complex computer engineering problems creatively, and have the ability of problem analysis, modeling and implementation of complex computer systems.

Course Description

 This course aims to provide a comprehensive training of design and application of data structures, which includes problem analysis, general design, user interface design, programming skills, software specification, and scientific working styles of software development. Different from the experiments of the course Data Structures, which aims to implement some simple and small algorithms, this course focuses on training the students' ability to analyze problems and apply advanced data structures and algorithms.

Teaching Content and Class Hours Distribution

Project defense          1 week

Experimental Teaching

Project defense          1 week

Teaching Method

Experimental teaching. The teaching contents are released in the form of homework. Students are asked to form teams freely, complete experiments after class, organize the experimental reports, and attend the project defense in groups.


Examination Method

  1. Project defense 60%.

  2. Experimental report 40%.

Teaching Materials and Reference Books

[1] Clifford A. Shaffer, “A Practical Introduction to Data Structures and Algorithm Analysis (2nd edition)”, Publishing House of Electronics Industry (Chinese Publisher), 2009

[2] Adam Drozdek, “Data Structures and Algorithms in C++ (2nd edition)”, Brooks/Cole, 2001

[3] Nell Dale, “C++ Data Structures (3rd edition)”, Jones and Bartlett Publishers, Inc, 2003

 [4]严蔚敏,吴伟民,数据结构(C语言版),清华大学出版社,20037月再版;

 [5]肖南峰,赵洁,数据结构与算法设计,电子工业出版社,200612月出版;

[6] 傅清祥,王晓东,算法与数据结构,电子工业出版社,2001

[7] 吴文虎,王建德,实用算法的分析与程序设计,电子工业出版社,1998

[8] William F.William T.Data Structures with C++Prentice HallInc.1996

Prepared by Whom and When

Jianming Lv 15/4/2019