Chevron Left
Zurück zu Datenstrukturen

Kursteilnehmer-Bewertung und -Feedback für Datenstrukturen von University of California San Diego

4,076 Bewertungen
686 Bewertungen

Über den Kurs

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!...


23. Mai 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!

9. Juli 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.

Filtern nach:

451 - 475 von 669 Bewertungen für Datenstrukturen

von 121910304030 D B

14. Dez. 2020



13. Dez. 2020



13. Dez. 2020



11. Dez. 2020


von 221910301018 C V N S P

5. Dez. 2020



30. Nov. 2020



11. Nov. 2020


von 121910305046 P S V S

31. Okt. 2020


von 121910305044 B S D

30. Okt. 2020


von 121910308046 V U S K

28. Okt. 2020


von KOYA R N

15. Okt. 2020


von Sasisrivundavilli

15. Okt. 2020


von 121910309040 N A K

7. Okt. 2020


von Kamal K

2. Okt. 2020


von 121910303030 A T

27. Sep. 2020


von ALE P K

15. Sep. 2020


von Omkar V G

23. Juli 2020


von Vineetha B

7. Juli 2020


von Pratik A R

22. Apr. 2020


von D A

19. Apr. 2020


von Sonu M

18. Feb. 2019


von Lie C

19. Juni 2018


von 하림 이

30. Okt. 2017


von JeongEuiDong

29. Okt. 2017


von Harshit S

27. Aug. 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.