课程信息
404,294 次近期查看

第 1 门课程(共 6 门)

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

中级

完成时间大约为33 小时

建议:5 weeks of study, 4-8 hours/week...

英语(English)

字幕:英语(English), 西班牙语(Spanish)

您将学到的内容有

  • Check

    Essential algorithmic techniques

  • Check

    Design efficient algorithms

  • Check

    Practice solving algorithmic interview problems

  • Check

    Implement efficient and reliable solutions

您将获得的技能

Dynamic ProgrammingDebuggingSoftware TestingAlgorithmsComputer Programming

第 1 门课程(共 6 门)

100% 在线

立即开始,按照自己的计划学习。

可灵活调整截止日期

根据您的日程表重置截止日期。

中级

完成时间大约为33 小时

建议:5 weeks of study, 4-8 hours/week...

英语(English)

字幕:英语(English), 西班牙语(Spanish)

学习Course的学生是

  • Machine Learning Engineers
  • Software Engineers
  • Data Scientists
  • Data Engineers
  • Systems Engineers

教学大纲 - 您将从这门课程中学到什么

1
完成时间为 5 小时

Programming Challenges

6 个视频 (总计 48 分钟), 6 个阅读材料, 3 个测验
6 个视频
Welcome!3分钟
Solving the Sum of Two Digits Programming Challenge (screencast)6分钟
Solving the Maximum Pairwise Product Programming Challenge: Improving the Naive Solution, Testing, Debugging13分钟
Stress Test - Implementation8分钟
Stress Test - Find the Test and Debug7分钟
Stress Test - More Testing, Submit and Pass!8分钟
6 个阅读材料
Companion MOOCBook10分钟
What background knowledge is necessary?10分钟
Optional Videos and Screencasts10分钟
Maximum Pairwise Product Programming Challenge10分钟
Using PyCharm to solve programming challenges10分钟
Acknowledgements2分钟
1 个练习
Solving Programming Challenges20分钟
2
完成时间为 5 小时

Algorithmic Warm-up

12 个视频 (总计 77 分钟), 3 个阅读材料, 4 个测验
12 个视频
Coming Up3分钟
Problem Overview3分钟
Naive Algorithm5分钟
Efficient Algorithm3分钟
Problem Overview and Naive Algorithm4分钟
Efficient Algorithm5分钟
Computing Runtimes10分钟
Asymptotic Notation6分钟
Big-O Notation6分钟
Using Big-O10分钟
Course Overview10分钟
3 个阅读材料
Resources2分钟
Resources2分钟
Resources2分钟
3 个练习
Logarithms10分钟
Big-O10分钟
Growth rate10分钟
3
完成时间为 4 小时

Greedy Algorithms

10 个视频 (总计 56 分钟), 1 个阅读材料, 3 个测验
10 个视频
Car Fueling7分钟
Car Fueling - Implementation and Analysis9分钟
Main Ingredients of Greedy Algorithms2分钟
Celebration Party Problem6分钟
Efficient Algorithm for Grouping Children5分钟
Analysis and Implementation of the Efficient Algorithm5分钟
Long Hike6分钟
Fractional Knapsack - Implementation, Analysis and Optimization6分钟
Review of Greedy Algorithms2分钟
1 个阅读材料
Resources2分钟
2 个练习
Greedy Algorithms10分钟
Fractional Knapsack10分钟
4
完成时间为 7 小时

Divide-and-Conquer

20 个视频 (总计 157 分钟), 5 个阅读材料, 6 个测验
20 个视频
Intro3分钟
Linear Search7分钟
Binary Search7分钟
Binary Search Runtime8分钟
Problem Overview and Naïve Solution6分钟
Naïve Divide and Conquer Algorithm7分钟
Faster Divide and Conquer Algorithm6分钟
What is the Master Theorem?4分钟
Proof of the Master Theorem9分钟
Problem Overview2分钟
Selection Sort8分钟
Merge Sort10分钟
Lower Bound for Comparison Based Sorting12分钟
Non-Comparison Based Sorting Algorithms7分钟
Overview2分钟
Algorithm9分钟
Random Pivot13分钟
Running Time Analysis (optional)15分钟
Equal Elements6分钟
Final Remarks8分钟
5 个阅读材料
Resources10分钟
Resources5分钟
Resources10分钟
Resources5分钟
Resources10分钟
5 个练习
Linear Search and Binary Search10分钟
Polynomial Multiplication15分钟
Master Theorem10分钟
Sorting15分钟
Quick Sort15分钟
4.7
1081 个审阅Chevron Right

35%

完成这些课程后已开始新的职业生涯

36%

通过此课程获得实实在在的工作福利

15%

加薪或升职

来自Algorithmic Toolbox的热门评论

创建者 SGJan 20th 2017

I liked the fact that the algorithms are not just the introductory searching and sorting algorithms. The assignments are fairly difficult (I have decent scripting experience), but not impossibly so.

创建者 MBMar 6th 2018

Cool course. Thank you! One suggestion about your book (Learning Algorithms Through Programming and Puzzle Solving): could you add some theory which would serve as a brief reminder before problems?

讲师

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering
Avatar

Pavel Pevzner

Professor
Department of Computer Science and Engineering
Avatar

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics

关于 加州大学圣地亚哥分校

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 communicamathematics, engineering, and more. Learn more on www.hse.ru...

关于 数据结构与算法 专项课程

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
数据结构与算法

常见问题

  • 注册以便获得证书后,您将有权访问所有视频、测验和编程作业(如果适用)。只有在您的班次开课之后,才可以提交和审阅同学互评作业。如果您选择在不购买的情况下浏览课程,可能无法访问某些作业。

  • 您注册课程后,将有权访问专项课程中的所有课程,并且会在完成课程后获得证书。您的电子课程证书将添加到您的成就页中,您可以通过该页打印您的课程证书或将其添加到您的领英档案中。如果您只想阅读和查看课程内容,可以免费旁听课程。

还有其他问题吗?请访问 学生帮助中心