Wade Fagen-Ulmschneider
The Unordered Data Structures course covers the data structures and algorithms needed to implement hash tables, disjoint sets and graphs. These fundamental data structures are useful for unordered data. For example, a hash table provides immediate access to data indexed by an arbitrary key value, that could be a number (such as a memory address for cached memory), a URL (such as for a web cache) or a dictionary. Graphs are used to represent relationships between items, and this course covers several different data structures for representing graphs and several different algorithms for traversing graphs, including finding the shortest route from one node to another node. These graph algorithms will also depend on another concept called disjoint sets, so this course will also cover its data structure and associated algorithms. The University of Illinois at Urbana–Champaign is a world leader in research, teaching and public engagement, distinguished by the breadth of its programs, broad academic excellence, and internationally renowned faculty and alumni. Illinois serves the world by creating knowledge, preparing students for lives of impact, and finding solutions to critical societal needs.
Instructor Details
Courses : 3
Specification: Unordered Data Structures
|
26 reviews for Unordered Data Structures
Add a review
| Price | Free |
|---|---|
| Provider | |
| Duration | 16 hours |
| Year | 2019 |
| Language | English |
| Certificate | Yes |
| Quizzes | Yes |
![The Design and Analysis of Algorithm Masterclass [ 2019 ]](https://courses.javacodegeeks.com/wp-content/uploads/2020/02/2484706_b943-300x300.jpg)
Amar R –
Thanks for offering this challenging course!
Venkatesh M –
Excellent course! Looking forward to a more advanced course from the same course staff!
Ravi K –
Very Challenging course. Learned a lot, very clear instruction. Assignments were interesting and challenging.
Vladimir N –
I’ve audited this course. It was useful for me. Thanks.
Tomer B –
The lecturer is super excellent and super clear. I wish he has more courses here.
Hovannes J –
The third course in the specialization was quite dense, but the instructor did a great job providing a sufficiently clear overview + detail; the assignments are fun and interesting. Would be good to have more opportunities to code.
Yuguang T –
One of the best online classes I have ever had! That said, this is probably not a course for someone who don’t know data structures already. I learned data structures and algorithms a couple years ago and had done many interview algorithm problems so this series of courses help me to review things I know in C++. Nevertheless, great course design, great material and incredible presentation by the instructor!
Yuxin W –
Good course with good exercises.
Harsh B K –
Great Assignments…
Ping W –
Great class! Exceeded my expectations!
Kai J Z –
Awesome!
Yuyuan L –
One of the best courses in Coursera!
Guo L –
This course is good though some of the contents may need refinement. Code examples are very helpful.
Abe P –
Great introduction to Unordered Data Structures, a topic I was unfamiliar with. This class is a little more challenging then the first two classes in the sequence but well worth the additional C++ experience and information.
Timo K –
The course has amazing explanations of data structures and thoughtful exercises. If I had one gripe it would be that there is too little coding. While the exercises require thinking you don’t write a whole lot of code.
Parag S –
Very Nice Course, recommended for every Computer student.
Aren T –
An outstanding conclusion to this MOOC specialization. I have learnt a huge amount on this course, and the opportunity to do programming assignments where you have to make additions to a provided substantial codebase is a brilliant learning strategy. The exposure to this high quality code gives you plenty to read/digest. Meanwhile, the quizzes are superb and consolidate learning, and the video lectures are excellent. All in all, brilliant; you both learn a huge amount about computer science/data structures & algorithms, and you also develop some serious exposure to C++. Thoroughly recommend this Specialization.
Christopher M P –
Quick, automatic grading is nice, but final challenge problems that require simply filling in a couple of lines, and not enough problems requiring one to write a function on one’s own.
Andre A M –
Great (non math proof) introduction to topics such as Disjoint sets and Graphs. It’s a bit more theoretical than the other two courses and topics are covered at a high level with decent examples. Of the three courses, this one was more confusing and challenging at times. I’d definitely recommend this course as a good foundational stepping stone to other algorithm specializations on Coursera.
Yasaman S –
I wish the course was more detailed. Some PDFs to explain the concept more. Other than that I am happy with the content.
Luke L –
Great course! Very interesting lecture material / content. I can’t give this course a five however, as the assignments seem unnecessarily convoluted, and abstracted to demonstrate the material.
Arvind D R –
Needs to be a bit more in detail
Doudou H –
Simple examples make the concepts easy to understand. A great course.
Joshua T –
Really good and succinct course to gain a foundational understanding of data structures & algorithms. I would have liked some more challenging assignments, as I could complete some of them without writing more than 20 lines of code.
Difan G –
Some Terminology is way too unclear and inconsistent, creating a lot of confusion. So are the lecture videos. The course length and materials are at the right pace and volume. I hope the instructor can provide more detailed explanation on many specific points and tie back to earlier chapters. This is a good course, but definitely need a lot of polish.
Oleksii S –
Highly recommended course! The explanations are very clear and to the point. The exercises code is a bit complicated if used just for demonstration purposes, but instructors try to show applications of the covered topics to real world problems (in a simplified way, of course), which is good.