This course is part of the Accelerated Computer Science Fundamentals Specialization

4.7
stars
517 ratings

Wade Fagen-Ulmschneider

15,882 already enrolled

Offered By

Accelerated Computer Science Fundamentals SpecializationUniversity of Illinois at Urbana-Champaign

About this Course

16,782 recent views

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.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Course 3 of 3 in the

Accelerated Computer Science Fundamentals Specialization

Approx. 20 hours to complete

English

Could your company benefit from training employees on in-demand skills?

Try Coursera for Business

Flexible deadlines

Reset deadlines in accordance to your schedule.

Shareable Certificate

Earn a Certificate upon completion

100% online

Start instantly and learn at your own schedule.

Course 3 of 3 in the

Accelerated Computer Science Fundamentals Specialization

Approx. 20 hours to complete

English

Could your company benefit from training employees on in-demand skills?

Try Coursera for Business

Instructor

Instructor rating

4.7/5 (100 Ratings)

Wade Fagen-Ulmschneider

Teaching Assistant Professor

Computer Science

95,377 Learners

4 Courses

Offered by

University of Illinois at Urbana-Champaign

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

Learn more about Coursera for Business

Syllabus - What you will learn from this course

Week1

Week 1

8 hours to complete

Orientation; Hashing

8 hours to complete

7 videos (Total 43 min), 5 readings, 4 quizzes

7 videos

Lesson 1.1.1 Hashing Introduction5mLesson 1.1.2 Hashing - Hash Function10mLesson 1.1.3 Hashing - Hash Function Examples4mLesson 1.1.4 Collision Handling I: Separate Chaining4mLesson 1.1.5 Collision Handling II: Probing and Double Hashing12mLesson 1.1.6 Hashing Analysis3mLesson 1.1.7 Hash Tables in C++2m

5 readings

Syllabus10mAdditional References for C++10mWeek 1 Overview10mImportant Tips and Notes for All Challenge Problems10mGuidelines for Asking for Help With Code10m

3 practice exercises

Orientation Quiz5mWeek 1 Quiz30mWeek 1 Challenge Problem30m

Week2

Week 2

3 hours to complete

Disjoint Sets

3 hours to complete

6 videos (Total 32 min), 2 readings, 2 quizzes

6 videos

2.1.1 Disjoint Sets: Introduction4m2.1.2 Disjoint Sets: Naive Implementation4m2.1.3 Disjoint Sets: UpTrees - A Better Implementation6m2.1.4 UpTrees: Simple Running Time3m2.1.5A UpTrees: Smart Union & Path Compression I8m2.1.5B UpTrees: Smart Union & Path Compression II4m

2 readings

Week 2 Overview10mTerminology Note: "Disjoint Sets" and "Union-Find"1m

2 practice exercises

Week 2 Quiz1hWeek 2 Challenge Problem1h

Week3

Week 3

7 hours to complete

Graph Data Structures

7 hours to complete

5 videos (Total 35 min), 1 reading, 3 quizzes

Week4

Week 4

3 hours to complete

Graph Algorithms

3 hours to complete

11 videos (Total 75 min), 1 reading, 2 quizzes

11 videos

4.1.1 Graphs: BFS Traversal8m4.1.2 Graphs: BFS Analysis9m4.1.3 Graphs: DFS Traversal8m4.2.1 Minimum Spanning Trees (MST) Introduction2m4.2.2 MST: Kruskal's Algorithm I6m4.2.3 MST: Kruskal's Algorithm II5m4.2.4 MST: Prim's Algorithm9m4.3.1 Graphs: Dijkstra's Algorithm6m4.3.2 Graphs: Dijkstra's Edge Cases8m4.3.3 Graphs: Dijkstra's Running Time2m4.3.4 Graphs: Landmark Path Problem7m

1 reading

Week 4 Overview10m

2 practice exercises

Week 4 Quiz30mWeek 4 Challenge Problem1h

Reviews

4.7

108 reviews

5 stars
80.19%
4 stars
14.23%
3 stars
4.03%
2 stars
0.57%
1 star
0.96%

TOP REVIEWS FROM UNORDERED DATA STRUCTURES

by RKJan 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.

by IAMar 15, 2020

A lot of new concepts learned. However I would have like to do more programming, exploring more features of C++. Changing only one or two lines of an existing code does not help much in our learning.

by LLAug 24, 2020

#inlcude<iostream>

int main(){

std::cout<<"The Best C++ Courses in Data Structures Out There"<<std::endl;

return 0;

}

by JAMar 9, 2021

Excellent Course really helpful and exercises enjoyable exercises!!!

Very good teacher!

5 star

(You need to know C++ in advance).

View all reviews

About the Accelerated Computer Science Fundamentals Specialization

Topics covered by this Specialization include basic object-oriented programming, the analysis of asymptotic algorithmic run times, and the implementation of basic data structures including arrays, hash tables, linked lists, trees, heaps and graphs, as well as algorithms for traversals, rebalancing and shortest paths.

This Specialization sequence is designed to help prospective applicants to the flexible and affordable Online Master of Computer Science (MCS) and MCS in Data Science prepare for the Online MCS Entrance Exam. The Online MCS Entrance Exam allows applicants who do not have graded and transcripted prerequisite CS coursework in the areas of data structures, algorithms, and object-oriented programming to strengthen their applications for admission. Learn more about the Online MCS Entrance Exam.

Accelerated Computer Science Fundamentals

Frequently Asked Questions

When will I have access to the lectures and assignments?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
The course may not offer an audit option. 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. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
If you subscribed, you get a 7-day free trial during which you can cancel at no penalty. After that, we don’t give refunds, but you can cancel your subscription at any time. See our full refund policy.
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.

More questions? Visit the Learner Help Center.

Build employee skills, drive business results

Discover Coursera for Business

Unordered Data Structures

About this Course