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.

提供方

## 课程信息

### 学生职业成果

## 37%

## 39%

## 12%

### 您将获得的技能

### 学生职业成果

## 37%

## 39%

## 12%

#### 可分享的证书

#### 100% 在线

#### 第 2 门课程（共 6 门）

#### 可灵活调整截止日期

#### 中级

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

#### 完成时间大约为27 小时

#### 英语（English）

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

**完成时间为 4 小时**

## Basic Data Structures

In this module, you will learn about the basic data structures used throughout the rest of this course. We start this module by looking in detail at the fundamental building blocks: arrays and linked lists. From there, we build up two important data structures: stacks and queues. Next, we look at trees: examples of how they’re used in Computer Science, how they’re implemented, and the various ways they can be traversed. Once you’ve completed this module, you will be able to implement any of these data structures, as well as have a solid understanding of the costs of the operations, as well as the tradeoffs involved in using each data structure.

**完成时间为 4 小时**

**7 个视频**

**7 个阅读材料**

**1 个练习**

**完成时间为 1 小时**

## Dynamic Arrays and Amortized Analysis

In this module, we discuss Dynamic Arrays: a way of using arrays when it is unknown ahead-of-time how many elements will be needed. Here, we also discuss amortized analysis: a method of determining the amortized cost of an operation over a sequence of operations. Amortized analysis is very often used to analyse performance of algorithms when the straightforward analysis produces unsatisfactory results, but amortized analysis helps to show that the algorithm is actually efficient. It is used both for Dynamic Arrays analysis and will also be used in the end of this course to analyze Splay trees.

**完成时间为 1 小时**

**5 个视频**

**1 个阅读材料**

**1 个练习**

**完成时间为 6 小时**

## Priority Queues and Disjoint Sets

We start this module by considering priority queues which are used to efficiently schedule jobs, either in the context of a computer operating system or in real life, to sort huge files, which is the most important building block for any Big Data processing algorithm, and to efficiently compute shortest paths in graphs, which is a topic we will cover in our next course. For this reason, priority queues have built-in implementations in many programming languages, including C++, Java, and Python. We will see that these implementations are based on a beautiful idea of storing a complete binary tree in an array that allows to implement all priority queue methods in just few lines of code. We will then switch to disjoint sets data structure that is used, for example, in dynamic graph connectivity and image processing. We will see again how simple and natural ideas lead to an implementation that is both easy to code and very efficient. By completing this module, you will be able to implement both these data structures efficiently from scratch.

**完成时间为 6 小时**

**15 个视频**

**6 个阅读材料**

**3 个练习**

**完成时间为 6 小时**

## Hash Tables

In this module you will learn about very powerful and widely used technique called hashing. Its applications include implementation of programming languages, file systems, pattern search, distributed key-value storage and many more. You will learn how to implement data structures to store and modify sets of objects and mappings from one type of objects to another one. You will see that naive implementations either consume huge amount of memory or are slow, and then you will learn to implement hash tables that use linear memory and work in O(1) on average! In the end, you will learn how hash functions are used in modern disrtibuted systems and how they are used to optimize storage of services like Dropbox, Google Drive and Yandex Disk!

**完成时间为 6 小时**

**22 个视频**

**4 个阅读材料**

**2 个练习**

### 审阅

#### 4.7

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

Data Structures was really interesting over all, also assignments are quite challenging. It's important to consult the external references & discussion forums if you want to get the best of it.

great course with challenging assignments, the problem with the course is the accent of some of the lecturers which make the lecture harder to follow also not enough examples in the lectures

I found the course a little tough, but it's worth the effort. It takes more time than mentioned. Apart from that, it is actually good and covers most of the topics required for interviews.

The lectures and the reading material were great. The assignments are challenging and require thought before attempting. The forums were really useful when I got stuck with the assignments

The best data structures course that I have taken!\n\nThe complex topics are made simpler at the expense of teaching style that allowed me to make it applicable in a real world situations.

The video content is nice. However, the best part of enrolling the course was the problem questions that were given. I learned a lot by solving the questions of programming assignments.

Amazing course.\n\nInteresting exercises help with learning and understanding of internal mechanisms basic data structures, how some of them work, the pros and cons of each.\n\nThanks!

Excellent review on data structures. I've taken a graduate level course covering advanced data structures, but I was still able to learn new things through the challenging assignments.

Perfect course for learning more about fundamental data structures, except for presentations on few difficult topics like splay trees, where explanations can be made more elaborate!

I Learnt a lot from this course and am forever in debt of the wonderful teachers, moderators and fellow course takers who were much help in the discussions. 10/10 will recommend !!

Very good course for data structures like stack, queue, linked list, hash tables, binary search trees, splay trees, avl trees.\n\nBST assignment has very challenging problems.

Tough yet excellent course. The assignments keeps you on your toes and make you think harder. The professors are great and have done a commendable job. Thanks for all the help

The course is good for the beginner it makes the programmer to think all the test cases but instead there should be more no of questions as a part of programming assignment.

Cool course, that describes essential of main data structures and explains their characteristics, use cases and realization. Strongly recommended for software engineers!

This course is well paced and covers all the data structures needed to code efficiently. This course also provides good real life problems in the form of assignments.

I don't understand the need for the lecturer to be in the video, it's actually kind of distracting. Also, more worked out examples of the algorithm would be helpful.

Interesting, challenging and just like the algorithmic toolbox course a FANTASTIC way to practise implementing solutions in a programming language of your choice.

It's a fine course, you'll get a LOT of information but it's up to you to keep it. Personally, I would've liked more types of trees but anyways I am satisfied.

Great Courses. I have a much more clearer understanding now about the basic data structure and how to use them. The assignments are the most important part.

Course is Excellent.\n\nThe final week is a bit fast, understanding the splay was very difficult for me.\n\nCould have given more examples for splay trees.

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

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

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

## 常见问题

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

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

我订阅此专项课程后会得到什么？

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

退款政策是如何规定的？

有助学金吗？

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