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.

# 数据结构与算法 专项课程

Master Algorithmic Programming Techniques. Learn algorithms through programming and advance your software engineering or data science career

**85,855**人已注册！

## 关于此 专项课程

### 您将学到的内容有

Apply basic algorithmic techniques such as greedy algorithms, binary search, sorting and dynamic programming to solve programming challenges.

Apply various data structures such as stack, queue, hash table, priority queue, binary search tree, graph and string to solve programming challenges.

Apply graph and string algorithms to solve real-world challenges: finding shortest paths on huge maps and assembling genomes from millions of pieces.

Solve complex programming challenges using advanced techniques: maximum flow, linear programming, approximate algorithms, SAT-solvers, streaming.

### 您将获得的技能

#### 100% 在线课程

#### 灵活的计划

#### 中级

Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.

#### 完成时间大约为6 个月

#### 英语（English）

### 专项课程的运作方式

### 加入课程

Coursera 专项课程是帮助您掌握一门技能的一系列课程。若要开始学习，请直接注册专项课程，或预览专项课程并选择您要首先开始学习的课程。当您订阅专项课程的部分课程时，您将自动订阅整个专项课程。您可以只完成一门课程，您可以随时暂停学习或结束订阅。访问您的学生面板，跟踪您的课程注册情况和进度。

### 实践项目

每个专项课程都包括实践项目。您需要成功完成这个（些）项目才能完成专项课程并获得证书。如果专项课程中包括单独的实践项目课程，则需要在开始之前完成其他所有课程。

### 获得证书

在结束每门课程并完成实践项目之后，您会获得一个证书，您可以向您的潜在雇主展示该证书并在您的职业社交网络中分享。

### 此专项课程包含 6 门课程

### Algorithmic Toolbox

The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).

### 数据结构

A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. In this course, we consider the common data structures that are used in various computational problems. You will learn how these data structures are implemented in different programming languages and will practice implementing them in our programming assignments. This will help you to understand what is going on inside a particular built-in implementation of a data structure and what to expect from it. You will also learn typical use cases for these data structures.

### Algorithms on Graphs

If you have ever used a navigation service to find optimal route and estimate time to destination, you've used algorithms on graphs. Graphs arise in various real-world situations as there are road networks, computer networks and, most recently, social networks! If you're looking for the fastest time to get to work, cheapest way to connect set of computers into a network or efficient algorithm to automatically find communities and opinion leaders in Facebook, you're going to work with graphs and algorithms on graphs.

### 字符串算法

World and internet is full of textual information. We search for information using textual queries, we read websites, books, e-mails. All those are strings from the point of view of computer science. To make sense of all that information and make search efficient, search engines use many string algorithms. Moreover, the emerging field of personalized medicine uses many search algorithms to find disease-causing mutations in the human genome.

### 行业合作伙伴

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

### 关于 国立高等经济大学

### 审阅

#### 4.6

##### 来自数据结构与算法的热门评论

I really enjoy this course, and I can definitely say that this specialization is perfect for those who would like to learn programming from the base and use it in different languages

The course is fundamentally useful, this helped me out a lot to discover my enthusiasm since my background is non-IT. I'm on the way to the second course in this specialization!

The only thing I missed in this course (and specialization) was more visual, intuitive approach to explanation. Programming assignments are rewarding.

Another great course in this specialization with challenging and interesting assignments. However, this one is somewhat harder but rewarding.

This course is the basic of specialization and helped a lot to understand algorithms in a better way. Thanks so much to are the teachers

Great course, and part of a great specialization. Lesson are well constructed, and the assignments reflect the lectures very well.

I would like to say thank you to all who have created this course and specialization! Good material, excellent lecturers!

This is a very challenging course in the specialization. I learned a lot form going through the programming assignments!

## 常见问题

退款政策是如何规定的？

我可以只注册一门课程吗？

可以！点击您感兴趣的课程卡开始注册即可。注册并完成课程后，您可以获得可共享的证书，或者您也可以旁听该课程免费查看课程资料。如果您订阅的课程是某专项课程的一部分，系统会自动为您订阅完整的专项课程。访问您的学生面板，跟踪您的进度。

有助学金吗？

我可以免费学习课程吗？

此课程是 100% 在线学习吗？是否需要现场参加课程？

此课程完全在线学习，无需到教室现场上课。您可以通过网络或移动设备随时随地访问课程视频、阅读材料和作业。

What will I be able to do upon completing the Specialization?

You will be able to apply the right algorithms and data structures in your day-to-day work and write programs that work in some cases many orders of magnitude faster. You'll be able to solve algorithmic problems like those used in the technical interviews at Google, Facebook, Microsoft, Yandex, etc. If you do data science, you'll be able to significantly increase the speed of some of your experiments. You'll also have a completed Capstone either in Bioinformatics or in the Shortest Paths in Road Networks and Social Networks that you can demonstrate to potential employers.

What background knowledge is necessary?

1. Basic knowledge of at least one programming language: C++, Java, Python, C, C#, Javascript, Haskell, Kotlin, Ruby, Rust, Scala.

We expect you to be able to implement programs that: 1) read data from the standard input (in most cases, the input is a sequence of integers); 2) compute the result (in most cases, a few loops are enough for this); 3) print the result to the standard output. For each programming challenge in this course, we provide starter solutions in C++, Java, and Python. The best way to check whether your programming skills are enough to go through problems in this specialization is to solve two problems from the first week. If you are able to pass them (after reading our tutorials), then you will definitely be able to pass the course.

2. Basic knowledge of discrete mathematics: proof by induction, proof by contradiction.

Knowledge of discrete mathematics is necessary for analyzing algorithms (proving correctness, estimating running time) and for algorithmic thinking in general. If you want to refresh your discrete mathematics skills, we encourage you to go through our partner specialization — Introduction to Discrete Mathematics for Computer Science (https://www.coursera.org/specializations/discrete-mathematics). It teaches the basics of discrete mathematics in try-this-before-we-explain-everything approach: you will be solving many interactive puzzles that were carefully designed to allow you to invent many of the important ideas and concepts yoursel

What is the difference between this course and other courses covering algorithms?

We believe that learning the theory behind algorithms (like in most Algorithms 101 courses taught at 1000s universities) is important but not sufficient for a professional computer scientist today. This specialization combines the theory of algorithms with many programming challenges. In contrast with many Algorithms 101 courses, you will implement over 100 algorithmic problems in the programming language of your choice. And you will see yourself that the best way to understand an algorithm is to implement it!

完成专项课程需要多长时间？

Time to completion can vary based on your schedule, but most learners are able to complete the Specialization in 6-8 months.

此专项课程中每门课程的开课频率为多久？

Each course in the Specialization is offered on a regular schedule, with sessions starting about once per month. If you don't complete a course on the first try, you can easily transfer to the next session, and your completed work and grades will carry over.

Do I need to take the courses in a specific order?

We recommend taking the courses in the order presented, as each subsequent course will build on material from previous courses.

完成专项课程后我会获得大学学分吗？

Coursera courses and certificates don't carry university credit, though some universities may choose to accept Specialization Certificates for credit. Check with your institution to learn more.

Do I need to buy a textbook for this specialization?

The lectures in this specialization will be self-contained. Most lectures will be based on the bestselling textbook "Algorithms" co-authored by Sanjoy Dasgupta from University of California at San Diego as well as Christos Papadimitriou and Umesh Vazirani from University of California at Berkeley. In addition to UCSD and Berkeley, the textbook has been adopted in over 100 top universities and is available on Internet.

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