1 / 8

高级数据结构和算法分析 Advanced Data Structures and Algorithm Analysis

高级数据结构和算法分析 Advanced Data Structures and Algorithm Analysis. 主讲教师: 陈 越 Instructor: CHEN, YUE E-mail: chenyue@cs.zju.edu.cn. Courseware and homework sets can be downloaded from http://acm.zju.edu.cn/dsaa/. Data Structures and Algorithm Analysis in C (2 nd Edition)

cade
Download Presentation

高级数据结构和算法分析 Advanced Data Structures and Algorithm Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 高级数据结构和算法分析Advanced Data Structures and Algorithm Analysis 主讲教师: 陈 越 Instructor: CHEN, YUE E-mail: chenyue@cs.zju.edu.cn Courseware and homework sets can be downloaded from http://acm.zju.edu.cn/dsaa/

  2. Data Structures and Algorithm Analysis in C (2nd Edition) Mark Allen Weiss 陈 越 改编 Email: weiss@fiu.edu 教材(Text Book)

  3. 参考书目(Reference)  数据结构与算法分析(C语言版) 魏宝刚、陈越、王申康 编著 浙江大学出版社  Data Structures, Algorithms, and Applications in C++ 数据结构算法与应用——C++语言描述 (英文版) Sartaj Sahni McGraw-Hill & 机械工业出版社  数据结构课程设计 何钦铭、冯雁、陈越 著 浙江大学出版社

  4. 课程评分方法 (Grading Policies) Research Project (23 or 25) Homework (5) Q&A (0.5 each) Discussions (14) Total  45 Final Exam (55)

  5. Discussions (14) • Form groups of 3 or 4 • 28 in-class discussion topics • Each takes 3~5 minutes • 14 = 28  10 / 20

  6. Research topics (23 or 25) • Done in groups • 16 topics to choose from • Report (18 or 20 points) • In-class presentation (5~10 minutes, 5 points) • The speaker will be chosen randomly from all the contributors • If there are many volunteers, only one group will be chosen • If there is no volunteer, I will talk about it

  7. Homework (5) • Done independently • 10 problems • Collected before the end of the next class meeting • 5 = 10  10 / 20 • Late penalty: 2 points/week

  8. Q&A • For volunteers only • 0.5 point for each question asked/answered • come and claim your credits after each class session

More Related