This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures.
本课程是 Data Science Foundations: Data Structures and Algorithms 专项课程 专项课程的一部分
2,765 人已注册
课程信息
22,435 次近期查看
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
高级
Completion of previous courses. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.
完成时间大约为38 小时
英语（English）
字幕：英语（English）
您将学到的内容有
Describe basic algorithm design techniques
Create divide and conquer, dynamic programming, and greedy algorithms
Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems
您将获得的技能
- Analysis of Algorithms
- Algorithm Design
- Python Programming
- Data Structure Design
- Intractability
可灵活调整截止日期
根据您的日程表重置截止日期。
可分享的证书
完成后获得证书
100% 在线
立即开始，按照自己的计划学习。
高级
Completion of previous courses. Calculus, probability theory: distributions, expectations and moments. Some programming experience with Python.
完成时间大约为38 小时
英语（English）
字幕：英语（English）
提供方
科罗拉多大学波德分校
CU-Boulder is a dynamic community of scholars and learners on one of the most spectacular college campuses in the country. As one of 34 U.S. public institutions in the prestigious Association of American Universities (AAU), we have a proud tradition of academic excellence, with five Nobel laureates and more than 50 members of prestigious academic academies.
立即开始攻读硕士学位
此 课程 隶属于 科罗拉多大学波德分校 提供的 100% 在线 Master of Science in Data Science。
如果您被录取参加全部课程，您的课程将计入您的学位学习进程。
授课大纲 - 您将从这门课程中学到什么
完成时间为 11 小时
Divide and Conquer Algorithms
We will formally cover divide and conquer algorithms as a design scheme and look at some divide and conquer algorithms we have encountered in the past. We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s Algorithm), Fast Fourier Transforms (FFTs), and Finding Closest Pair of Points.
完成时间为 11 小时
9 个视频 （总计 231 分钟）, 11 个阅读材料, 6 个测验
完成时间为 9 小时
Dynamic Programming Algorithms
In this module, you will learn about dynamic programming as a design principle for algorithms. We will provide a step-by-step approach to formulating a problem as a dynamic program and solving these problems using memoization. We will cover dynamic programming for finding longest common subsequences, Knapsack problem and some interesting dynamic programming applications.
完成时间为 9 小时
6 个视频 （总计 131 分钟）, 6 个阅读材料, 6 个测验
完成时间为 7 小时
Greedy Algorithms
In this module, we will learn about greedy algorithms. We will understand the basic design principles for greedy algorithms and learn about a few algorithms for greedy scheduling and Huffman codes. We will also learn some interesting cases when being greedy provides a guaranteed approximation to the actual solution.
完成时间为 7 小时
5 个视频 （总计 114 分钟）, 4 个阅读材料, 4 个测验
完成时间为 11 小时
Intractability and Supplement on Quantum Computing
P vs NP, Examples such as Travelling Salesperson Problem, Vertex Cover, 3-Coloring and others; Integer Linear Programming and Translating Problems into Integer Programming.
完成时间为 11 小时
9 个视频 （总计 288 分钟）, 5 个阅读材料, 5 个测验
关于 Data Science Foundations: Data Structures and Algorithms 专项课程
Building fast and highly performant data science applications requires an intimate knowledge of how data can be organized in a computer and how to efficiently perform operations such as sorting, searching, and indexing. This course will teach the fundamentals of data structures and algorithms with a focus on data science applications. This specialization is targeted towards learners who are broadly interested in programming applications that process large amounts of data (expertise in data science is not required), and are familiar with the basics of programming in python. We will learn about various data structures including arrays, hash-tables, heaps, trees and graphs along with algorithms including sorting, searching, traversal and shortest path algorithms.
常见问题
我什么时候能够访问课程视频和作业？
我订阅此专项课程后会得到什么？
有助学金吗？
还有其他问题吗？请访问 学生帮助中心。
