Вернуться к структуры данных

4.6

звезд

Оценки: 3,455

•

Рецензии: 577

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.
A few examples of questions that we are going to cover in this class are the following:
1. What is a good strategy of resizing a dynamic array?
2. How priority queues are implemented in C++, Java, and Python?
3. How to implement a hash table so that the amortized running time of all operations is O(1) on average?
4. What are good strategies to keep a binary tree balanced?
You will also learn how services like Dropbox manage to upload some large files instantly and to save a lot of storage space!...

DG

May 24, 2016

I like this course very much! Rope is the cleverest task I have ever done! Of course, I hope in future I will work on even more difficult problems, but this is pretty good already for me as a student!

PS

Jul 10, 2020

I think the course content and assignments were great. A suggestion though, it will be more helpful if there are more and varied corner cases that would save time spent in thinking and making cases.

Фильтр по:

автор: Dheeraj S

•May 11, 2020

awsome

автор: Ujjawal K

•Jan 14, 2019

Great.

автор: Md. R Q S

•Sep 10, 2020

great

автор: Abisheke K A

•Sep 08, 2020

Super

автор: SOURAV K

•Apr 28, 2020

great

автор: 刘从从

•Mar 14, 2018

难度太大了

автор: ALE P K

•Sep 15, 2020

good

автор: Omkar V G

•Jul 23, 2020

Nice

автор: Vineetha B

•Jul 07, 2020

good

автор: Pratik A R

•Apr 22, 2020

Nice

автор: D A

•Apr 19, 2020

good

автор: Sonu M

•Feb 18, 2019

good

автор: Lie C

•Jun 19, 2018

good

автор: 하림 이

•Oct 31, 2017

good

автор: JeongEuiDong

•Oct 30, 2017

good

автор: Harshit S

•Aug 27, 2017

The course covered important data structures and gave an insight on how to counter challenging algorithmic problem through step by step analysis from a very simple approach through slowly and steadily approaching towards better performing algorithms .This gradual rise from a learner's perspective is priceless and helps in better proficiency of the topic.Week 1 taught us basic data structures such as arrays,linked list,stacks and queues and there applications while solving problems on network processing through representing the packets in the form of queues , proper parenthesization of algebraic expressions through an application of stack and representation of tree upside down which we see everywhere in computer science as well as finding the height of a n-ary tree.Week 2 represented very common data structure used in almost any production system's source code the Array List and its time analysis through a new method called amortized time which was analyzed through banker's method,physicist method and the aggregate method .Week 3 described some pretty fast data structures whose mere usage can increase performance considerably such as priority queues whose representation are binary heaps and have special characteristics of Sifting up and Sifting down to maintain the classic heap property and it introduces a very fast sorting algorithm called heap sort.And this was not it another data structure was introduced which is called the disjoint set ( Union find) which made finding paths in very large graphical systems just a formality.The best part of this data structure remained integral to the characteristic of the course to find the efficient solution gradually but definitely as it showed which finding the union find function first through representing as arrays and assigning the parents as indexes and slowly finding the problem in arrays to go through tree representation as a necessity not just because every one has done it.Then came the fourth week and a learner's performance seeking mindset was in full throttle whether it be hash tables,hash functions or distributed hash tables used by Google Drive, Yandex Disk or Drop box there was no way stopping it and thus whole week showed how much can be achieved through hash table representation of data on which these companies integral technologies are based on.On a personal note I also saw the representation of distributed hash tables in Akamai's cloud distributed networks.The week 5 dig deeper into Binary Search Trees and there representation as well as there height were subject to scrutiny with the several applications such as AVL trees as well as Splay Trees all showed certain characteristics of height balancing which are very useful in caching and thus were considered as assignment to have a look and feel of big classes and using methods such as merge and split to get fast retrieval.Thus performance oriented mind set was explored to the fullest through playing of these data structure and applying them on real life scenarios.

автор: Jenna W

•Sep 17, 2016

A really great course, you should definitely take this second after Algorithmic Toolbox, as that has an easier learning curve for the very 'CS professor' style code (lots of single letter variables and other quirks) and how projects should be submitted and tested.

That said, there is a lot of good learning in this course. Make sure you have some good Algorithms textbooks to accompany the lectures, they have recommendations in the course. I personally use Sedgewick's book and CLRS which aren't exactly what they suggest, but work well. Take your time with the learning, make sure you really understand the concepts before moving on to the homework. Use multiple sources to learn (they provide plenty of links!) and you'll do well.

In response to a very politely asked request for clarity: I rated this 4/5 rather than 5/5 stars as I found that for my preferred language (Python) some of the starter files were very poorly created. This meant I often have to rewrite the initial parsing of the inputs because it would create variables that contained incorrect or incomplete input data. Further, there were some non-harmful quirks like semi-colons or parameters shadowing Python reserved words in the code. The next course in this series, Algorithms on Graphs, did not seem to have any of these issues, though!

автор: Christopher W

•Mar 08, 2020

A really good course. I'd have to say the beginning lectures went pretty darn fast. If I hadn't had previous exposure to data structures, I'm sure I would have felt totally buried. As it is it served as a great refresher for the basics, and then the more advanced concepts later were well-presented and thoroughly analyzed. I have a good feel for the use and running times of the operations discussed. I felt bad that I didn't do all the programming exercises when only like 2 or 3 were needed to pass. They were pretty challenging, and by the time I had done enough to pass I was like, OK moving on....maybe I'll circle back to the ones I didn't get to.

автор: Adrian H

•Sep 28, 2016

The final module with the Splay tree is way too difficult when compared to the rest of the material in the course. This course would be better structured with three assignments as follows: 1) tree order problem, 2) a simpler tree assignment that only deals with a basic binary search tree, 3) the set range sum problem implementing the splay tree, as an advanced problem. Aside from the difficulty of the last module, this is a great course. It's very comprehensive and you'll take away lots of useful information on course completion.

автор: Aman A

•Apr 10, 2020

A great interest generating course that gives us both an insight as well as an opportunity to explore the vast field of algorithms and data structures. I recommend to anyone that wants to start in this field as well as to those that are well-versed in this field as it will definitely teach you something new (if not new than a different perspective to looking at the same problem will definitely be provided) :).

Kudos, cheers and all the luck to my fellow learners, our teachers and to the students yet to undertake this course,

автор: Miguel R

•Sep 02, 2016

Excellent course in general, and I learned a lot of new data structures that one doesn't generally learn about in standard algorithms and data structures courses, like disjoint sets and splay trees.

Only complaint is that sometimes the problems are too complicated for how easy they are. By this I mean that the problem statement is very long and elaborate, when what they are really asking is something trivial that can be programmed in a few lines, but it takes a while to understand just what they are asking.

автор: Lee Z Y

•Sep 15, 2017

Great course! I figured disjoint sets was pretty interesting - the rest of the material I get by with no issues, but boy: the BST advanced assignments (splay trees) in week 6 is by far the hardest assignments I tried in both Algorithmic Toolbox and Data Structures. It's a pretty big jump in difficulty (I don't think they explained splay trees in the lectures very well; it was pretty fast), but I was so ecstatic when I solved it that I didn't mind.

автор: Lingjian K

•Jan 18, 2017

This course is very hard for non-STEM major student, even non CS-major student. Some concepts are very abstract to explain. The course team generally did a good job at explaining concept, but it would be better if they can offer more examples, animations, illustrations, sample code and explanations, etc. to help students understand these concepts. A rewarding course overall. Best if you are going to have a code interview.

автор: Rafael M

•Aug 05, 2017

This course was considerably harder than the first one. Content is top quality but slides lack detail and lectures some times don't do a good job explaining things well enough given the difficulty of some of the things they ask in the exercises. Still, I learned a lot of programming doing the exercises and I would still recommend it. If you're new to algorithms you will have to supplement using online resources + books.

автор: Umer M

•Sep 01, 2016

The last two weeks felt rushed. The Binary Search Tree/AVL Tree module doesn't have a quiz or an assignment and it's easy to move on without fully understanding both data structures. This allows for wasting time on the last assignment which relies on understanding AVL trees. I recommend reading the external resources for each lesson and making sure you have a grasp of the data structure before moving to the next module.

- Искусственный интеллект для каждого
- Введение в TensorFlow
- Нейронные сети и глубокое обучение
- Алгоритмы, часть 1
- Алгоритмы, часть 2
- Машинное обучение
- Машинное обучение с использованием Python
- Машинное обучение с использованием Sas Viya
- Программирование на языке R
- Введение в программирование на MATLAB
- Анализ данных с Python
- Основы AWS: введение в облачные приложения
- Основы Google Cloud Platform
- Обеспечение надежности веб-сервисов
- Разговорный английский язык на профессиональном уровне
- Наука благополучия
- Научитесь учиться
- Финансовые рынки
- Проверка гипотез в здравоохранении
- Основы повседневного руководства

- Глубокое обучение
- Python для всех
- Наука о данных
- Прикладная наука о данных с Python
- Основы бизнеса
- Разработка архитектуры на платформе Google Cloud
- Инженерия данных на платформе Google Cloud
- От Excel до MySQL
- Продвинутое машинное обучение
- Математика в машинном обучении
- Беспилотные автомобили
- Блокчейн для организаций
- Бизнес-аналитика
- Навыки Excel для бизнеса
- Цифровой маркетинг
- Статистический анализ в здравоохранении на языке R
- Основы иммунологии
- Анатомия
- Управление инновациями и дизайн-мышление
- Основы позитивной психологии

- ИТ-поддержка Google
- Специалист IBM по привлечению клиентов
- Наука о данных IBM
- Прикладное управление проектами
- Профессиональная сертификация IBM в области прикладного ИИ
- Машинное обучение для Analytics
- Пространственный анализ данных и визуализация
- Проектирование и управление в строительстве
- Педагогический дизайн