浙江工商大学课程授课大纲
2009 / 2010学年 第 一 学期
|
课程信息 |
课程名称 |
Fundamentals of Data
Structures in C |
||||||
|
开课班级 |
物流0801，0802 |
|||||||
|
课程类型 |
专业课 |
学分 |
4 |
周学时 |
4 |
总学时 |
64 |
|
|
教学周 |
1—16 周 |
教室 |
E402 |
上课时间 |
每周一 第1-4节、每周四第1-4节
|
|||
|
教学安排 |
课堂讲授22次，上机实习6次 |
|||||||
|
教师 |
主讲教师 |
庄毅 |
电子信箱 |
zhuang@mail.zjgsu.edu.cn |
||||
|
答疑时间 |
第5-16周，周一下午1：30－2：30 |
答疑地点 |
信息楼508 |
|||||
|
助教 |
|
电子信箱 |
|
|||||
|
教材 |
指定教材：
FUNDAMENTALS OF DATA STRUCTURES IN C
Robert Kruse /C.L. Tonda / Bruce Leung 参考书目：1、“数据结构”（C语言版） 严蔚敏 吴伟民 编著 清华大学出版社 2、“数据结构”（第三版）----使用C语言 朱战立 刘天时 编著 西安交通大学出版社 |
|||||||
|
考试安排 |
期末考试1次（闭卷），考试范围是1- 10章（除第9章），布置课后作业。总分中各部分所占比例：平时成绩和上机实践 30％ ，期末考试70% 。 |
|||||||
|
教学目的 |
This is one of the important courses required for all
majors in Computer Science, Management Information and Electronic Business.
This course description is written based on the 《FUNDAMENTALS
OF DATA STRUCTURES IN C》. A large variety of data structures are used is many areas
of computer science, including the design and implementation of Operating
Systems, Database Systems, Compilers, Electronic Business Systems, Management
Information Systems, and virtually every application systems. With the
ever-lasting expansion of computer application, the amount of both numerical
and non-numerical computation has sharply increased. The volume of data
processing, as well as the complexity of data structures and the interactions
between them, is also increasing constantly. In this course, the various data structures
are discussed, including their logic representations and physical
representations in computer storage media (e.g., computer memory). Dynamic
properties of the data structures and their applications in classic
algorithms are demonstrated in concret examples. The goal is not only to
prepare students with knowledge of data structures required for future
courses, but also to improve their software design ability and programming
skills. In particular, students will learn how to select or design data
structures in problem solving with algorithms of optimal space and/or time
complexity. |
|||||||
|
课程要求 |
1.
对学生的课堂纪律要求：在课堂上做到动静结合，讨论热烈，听讲认真，独立积极思考，大胆发言。 2.
认真独立完成课后作业；每章内容课前做好预习，积极查阅有关资料辅助课堂教学以便更好地理解课程内容；分学习小组开展有关专题的讨论； 3.
上机之前认真准备老师布置的实验内容，编写好实验报告内容中要求的程序，实验结束上交实验报告。 |
|||||||
|
课程教学进程表 |
|||
|
周数 |
日期 |
时数 |
教学内容 |
|
1 |
9.14-9.18 |
4 |
|
|
2 |
9.21-9.25 |
4 |
|
|
3 |
9.28-10.2 |
4 |
上机1. 上机环境熟悉、稀疏矩阵运算(物流0801、0802)（1,2） 国庆放假 |
|
4 |
10.5-10.9 |
4 |
Chapter 3. STACKS AND QUEUES (10.10上10.8的课) |
|
5 |
10.12-10.16 |
4 |
上机2. 堆栈和队列(物流0801、0802) |
|
6 |
10.19-10.23 |
4 |
运动会 |
|
7 |
10.26-10.30 |
4 |
|
|
8 |
11.2-11.6 |
4 |
|
|
9 |
11.9-11.13 |
4 |
|
|
10 |
11.16-11.20 |
4 |
上机4. 树的算法设计 (物流0801、0802) |
|
11 |
11.23-11.27 |
4 |
|
|
12 |
11.30-12.4 |
4 |
上机5. 图的算法设计(物流0801、0802) |
|
13 |
12.7-12.11 |
4 |
|
|
14 |
12.14-12.18 |
4 |
上机6. 排序(物流0801、0802) |
|
15 |
12.21-12.25 |
4 |
|
|
16 |
12.28-1.1 |
4 |
答疑 |
|
17 |
1.4-1.8 |
4 |
Test |