Unordered Data Structures

Unordered Data Structures

This course is part of Accelerated Computer Science Fundamentals Specialization

Instructor: Wade Fagen-Ulmschneider

Access provided by Coursera Learning Team

19,199 already enrolled

4 modules

Gain insight into a topic and learn the fundamentals.

4.7

(549 reviews)

20 hours to complete

3 weeks at 6 hours a week

Flexible schedule

Learn at your own pace

4 modules

Gain insight into a topic and learn the fundamentals.

4.7

(549 reviews)

20 hours to complete

3 weeks at 6 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

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

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV

Share it on social media and in your performance review

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.

What's included

7 videos5 readings3 assignments1 programming assignment

7 videosTotal 43 minutes

Lesson 1.1.1 Hashing Introduction5 minutesPreview module
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 Chaining4 minutes
Lesson 1.1.5 Collision Handling II: Probing and Double Hashing12 minutes
Lesson 1.1.6 Hashing Analysis3 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: Introduction4 minutesPreview module
2.1.2 Disjoint Sets: Naive Implementation4 minutes
2.1.3 Disjoint Sets: UpTrees - A Better Implementation6 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 minutesPreview module
3.1.2 Graphs: Vocabulary8 minutes
3.1.3 Graphs: Edge List Implementation4 minutes
3.1.4 Graphs: Adjacency Matrix Implementation6 minutes
3.1.5 Graphs: Adjacency List Implementation8 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 74 minutes

4.1.1 Graphs: BFS Traversal8 minutesPreview module
4.1.2 Graphs: BFS Analysis9 minutes
4.1.3 Graphs: DFS Traversal8 minutes
4.2.1 Minimum Spanning Trees (MST) Introduction2 minutes
4.2.2 MST: Kruskal's Algorithm I6 minutes
4.2.3 MST: Kruskal's Algorithm II5 minutes
4.2.4 MST: Prim's Algorithm9 minutes
4.3.1 Graphs: Dijkstra's Algorithm6 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

Instructor

Instructor ratings

4.7 (108 ratings)

Wade Fagen-Ulmschneider

University of Illinois Urbana-Champaign

4 Courses123,184 learners

Offered by

University of Illinois Urbana-Champaign

Why people choose Coursera for their career

Felipe M.

Learner since 2018

"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."

Jennifer J.

Learner since 2020

"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."

Larry W.

Learner since 2021

"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."

Chaitanya A.

"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

Learner reviews

4.7

549 reviews

5 stars
80.76%
4 stars
13.79%
3 stars
3.99%
2 stars
0.54%
1 star
0.90%

Showing 3 of 549

Reviewed on May 31, 2020

An insanely good course in which the instructors and professors put in the maximum possible amount of work for the student's benefit and clarity. Learnt a ton!

Reviewed on Mar 10, 2021

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

Reviewed on Sep 23, 2020

Could have been a bit more explanatory for people not from CS background. Typos and mistakes should have been eliminated to the largest possible extent. Leaving these aside, nice course.

View more reviews