When will I have access to the lectures and assignments?

To access the course materials, assignments and to earn a Certificate, you will need to purchase the Certificate experience when you enroll in a course. You can try a Free Trial instead, or apply for Financial Aid. The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.

What will I get if I subscribe to this Specialization?

When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile.

Is financial aid available?

Yes. In select learning programs, you can apply for financial aid or a scholarship if you can’t afford the enrollment fee. If fin aid or scholarship is available for your learning program selection, you’ll find a link to apply on the description page.

Unordered Data Structures

Ends tomorrow! Save on skills that make you shine with 40% off 3 months of Coursera Plus. Save now

Unordered Data Structures

This course is part of Accelerated Computer Science Fundamentals Specialization

Instructor: Wade Fagen-Ulmschneider

20,056 already enrolled

Included with

Learn more

4 modules

Gain insight into a topic and learn the fundamentals.

557 reviews

2 weeks to complete

at 10 hours a week

Flexible schedule

Learn at your own pace

4 modules

Gain insight into a topic and learn the fundamentals.

557 reviews

2 weeks to complete

at 10 hours a week

Flexible schedule

Learn at your own pace

Skills you'll gain

Details to know

Shareable certificate

Add to your LinkedIn profile

Assessments

9 assignments

Taught in English

See how employees at top companies are mastering in-demand skills

Learn more about Coursera for Business

logos of Petrobras, TATA, Danone, Capgemini, P&G and L'Oreal

Build your subject-matter expertise

This course is part of the Accelerated Computer Science Fundamentals Specialization

When you enroll in this course, you'll also be enrolled in this Specialization.

Learn new concepts from industry experts
Gain a foundational understanding of a subject or tool
Develop job-relevant skills with hands-on projects
Earn a shareable career certificate

There are 4 modules in this course

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.

Module details

What's included

7 videos5 readings3 assignments1 programming assignment

7 videosTotal 43 minutes

Lesson 1.1.1 Hashing Introduction5 minutes
Lesson 1.1.2 Hashing - Hash Function10 minutes
Lesson 1.1.3 Hashing - Hash Function Examples4 minutes
Lesson 1.1.4 Collision Handling I: Separate Chaining5 minutes
Lesson 1.1.5 Collision Handling II: Probing and Double Hashing13 minutes
Lesson 1.1.6 Hashing Analysis4 minutes
Lesson 1.1.7 Hash Tables in C++2 minutes

5 readingsTotal 50 minutes

Syllabus10 minutes
Additional References for C++10 minutes
Week 1 Overview10 minutes
Important Tips and Notes for All Challenge Problems10 minutes
Guidelines for Asking for Help With Code10 minutes

3 assignmentsTotal 65 minutes

Orientation Quiz5 minutes
Week 1 Quiz30 minutes
Week 1 Challenge Problem30 minutes

1 programming assignmentTotal 300 minutes

Unordered Map Project300 minutes

What's included

6 videos2 readings2 assignments

6 videosTotal 32 minutes

2.1.1 Disjoint Sets: Introduction5 minutes
2.1.2 Disjoint Sets: Naive Implementation5 minutes
2.1.3 Disjoint Sets: UpTrees - A Better Implementation7 minutes
2.1.4 UpTrees: Simple Running Time3 minutes
2.1.5A UpTrees: Smart Union & Path Compression I8 minutes
2.1.5B UpTrees: Smart Union & Path Compression II4 minutes

2 readingsTotal 11 minutes

Week 2 Overview10 minutes
Terminology Note: "Disjoint Sets" and "Union-Find"1 minute

2 assignmentsTotal 120 minutes

Week 2 Quiz60 minutes
Week 2 Challenge Problem60 minutes

What's included

5 videos1 reading2 assignments1 programming assignment

5 videosTotal 35 minutes

3.1.1 Graphs: Introduction6 minutes
3.1.2 Graphs: Vocabulary9 minutes
3.1.3 Graphs: Edge List Implementation5 minutes
3.1.4 Graphs: Adjacency Matrix Implementation7 minutes
3.1.5 Graphs: Adjacency List Implementation9 minutes

1 readingTotal 10 minutes

Week 3 Overview10 minutes

2 assignmentsTotal 90 minutes

Week 3 Quiz30 minutes
Week 3 Challenge Problem60 minutes

1 programming assignmentTotal 300 minutes

Graph Search Project300 minutes

What's included

11 videos1 reading2 assignments

11 videosTotal 75 minutes

4.1.1 Graphs: BFS Traversal9 minutes
4.1.2 Graphs: BFS Analysis10 minutes
4.1.3 Graphs: DFS Traversal8 minutes
4.2.1 Minimum Spanning Trees (MST) Introduction2 minutes
4.2.2 MST: Kruskal's Algorithm I7 minutes
4.2.3 MST: Kruskal's Algorithm II5 minutes
4.2.4 MST: Prim's Algorithm10 minutes
4.3.1 Graphs: Dijkstra's Algorithm7 minutes
4.3.2 Graphs: Dijkstra's Edge Cases8 minutes
4.3.3 Graphs: Dijkstra's Running Time2 minutes
4.3.4 Graphs: Landmark Path Problem7 minutes

1 readingTotal 10 minutes

Week 4 Overview10 minutes

2 assignmentsTotal 90 minutes

Week 4 Quiz30 minutes
Week 4 Challenge Problem60 minutes

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV. Share it on social media and in your performance review.

Instructor

Instructor ratings

(109 ratings)

Wade Fagen-Ulmschneider

University of Illinois Urbana-Champaign

4 Courses130,868 learners

Offered by

University of Illinois Urbana-Champaign

Learner reviews

5 stars
80.43%
4 stars
14.18%
3 stars
3.94%
2 stars
0.53%
1 star
0.89%

Showing 3 of 557

Reviewed on Mar 9, 2021

Excellent Course really helpful and exercises enjoyable exercises!!!Very good teacher!5 star(You need to know C++ in advance).

Reviewed on Jul 14, 2021

It was a quick yet detailed intro to unordered data structures. A bit more advanced or difficult but very interesting. Enjoyed a lot.

Reviewed on Jan 11, 2021

Overall very good course. It is VERY time consuming if don't have background in CS. Each programming projects can easily take 35-40 hours to complete.

View more reviews