制作方:   美国加州大学圣地亚哥分校, 高等经济学院

  • Alexander S. Kulikov

    教学方:    Alexander S. Kulikov, Visiting Professor

    Department of Computer Science and Engineering

  • Michael Levin

    教学方:    Michael Levin, Lecturer

    Computer Science

  • Daniel M Kane

    教学方:    Daniel M Kane, Assistant Professor

    Department of Computer Science and Engineering / Department of Mathematics

  • Neil Rhodes

    教学方:    Neil Rhodes, Adjunct Faculty

    Computer Science and Engineering
基本信息
Course 3 of 6 in the 数据结构与算法 Specialization.
级别Intermediate
承诺学习时间5 weeks of study, 3-4 hours/week
语言
English
如何通过通过所有计分作业以完成课程。
用户评分
4.6 stars
Average User Rating 4.6查看学生的留言
Course 3 of Specialization
授课大纲

常见问题解答

我什么时候能够访问课程视频和作业?

如果我需要额外的时间来完成课程会怎么样?

我支付此课程之后会得到什么?

我能够免费学习此课程吗?

退款条例是如何规定的?

有助学金吗?

运作方式
课程作业
课程作业

每门课程都像是一本互动的教科书,具有预先录制的视频、测验和项目。

来自同学的帮助
来自同学的帮助

与其他成千上万的学生相联系,对想法进行辩论,讨论课程材料,并寻求帮助来掌握概念。

证书
证书

获得正式认证的作业,并与朋友、同事和雇主分享您的成功。

制作方
美国加州大学圣地亚哥分校
UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory.
高等经济学院
National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communications, IT, mathematics, engineering, and more. Learn more on www.hse.ru
价格
旁听购买课程
访问课程材料

可用

可用

访问评分的材料

不可用

可用

收到最终成绩

不可用

可用

获得可共享的证书

不可用

可用

评分和审阅
已评分 4.6,总共 5 个 307 评分

This was a really excellent little unit. I really appreciate going over all the algorithms in this course and I have a better understanding of how we explore graphs to find valuable information. I really enjoyed the challenge optional week as well. I felt less stress to complete it since it was optional, but it was still very challenging and I couldn't complete it (even though I really tried). I feel the challenge optional week may need to be made slightly easier though to give people who are normally busy to get a chance to try and solve the problems in it (it did eat up a lot of my spare time). Excellent work, great course (wish I knew contraction hierarchies better, been reading some papers but still unsure of how to best implement it).

Great course, great lectures!

great course!!!

Lectures were very clear and assignments were really helpful for me to understand gist of each algorithms. This course, however, only covers 1. Basic concepts of Graph, 2. Shortest Path, and 3. Minimum Spanning Tree which doesn’t seem to be rich.

With more diverse and interesting problems associated with Graph included, I strongly believe that students will get much from this course.

Thank you