In this course, you will learn new data structures for efficiently storing and retrieving data that is structured in an ordered sequence. Such data includes an alphabetical list of names, a family tree, a calendar of events or an inventory organized by part numbers. The specific data structures covered by this course include arrays, linked lists, queues, stacks, trees, binary trees, AVL trees, B-trees and heaps. This course also shows, through algorithm complexity analysis, how these structures enable the fastest algorithms to search and sort data.
This course is part of the Accelerated Computer Science Fundamentals Specialization
Ordered Data Structures
Offered By
About this Course
40,094 recent views
100% online
Start instantly and learn at your own schedule.
Course 2 of 3 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Approx. 19 hours to complete
English
Subtitles: English
Syllabus - What you will learn from this course
8 hours to complete
Orientation; Linear Structures
8 hours to complete
6 videos (Total 64 min), 6 readings, 4 quizzes
6 videos
1.1 Arrays11m
1.2 Linked Memory11m
1.3 Run Time Analysis13m
1.4 Array and List Operations10m
1.5 Queue (Data Structure)8m
1.6 Stack (Data Structure)8m
6 readings
Syllabus10m
Additional References for C++10m
Week 1 Overview10m
Downloading the Example C++ Source Code for Lecture with Git15m
Important Tips and Notes for All Challenge Problems10m
Guidelines for Asking for Help With Code10m
3 practice exercises
Orientation Quiz5m
Week 1 Quiz30m
Week 1 Challenge30m
2 hours to complete
Introduction to Tree Structures
2 hours to complete
5 videos (Total 54 min), 1 reading, 2 quizzes
5 videos
2.2 Binary Trees8m
2.3 Tree Traversals8m
2.4 Binary Search Trees19m
2.5 BST Analysis9m
1 reading
Week 2 Overview10m
2 practice exercises
Week 2 Quiz30m
Week 2 Challenge30m
7 hours to complete
Advanced Tree Structures
7 hours to complete
5 videos (Total 34 min), 1 reading, 3 quizzes
5 videos
3.1.2 AVL Analysis8m
3.2.1 B-Tree Introduction3m
3.2.2 B-Tree Insert7m
3.2.3 B-Tree Search4m
1 reading
Week 3 Overview10m
2 practice exercises
Week 3 Quiz30m
Week 3 Challenge30m
2 hours to complete
Heap Structures
2 hours to complete
5 videos (Total 30 min), 1 reading, 2 quizzes
5 videos
4.2 Heap Insert6m
4.3 Heap - RemoveMIN5m
4.4 Heap - buildHeap5m
4.5 Heap - Runtime Analysis3m
1 reading
Week 4 Overview10m
2 practice exercises
Week 4 Quiz30m
Week 4 Challenge30m
Reviews
4.8
TOP REVIEWS FROM ORDERED DATA STRUCTURES
by JTJan 20, 2020
Really good course so far. Using VSC + git bash on a Windows 10 machine for the programming assignments, and the web-based compiler for the challenges. Really good experiences so far.
by HNAug 24, 2019
My favorite Coursera specialization! Responsive staff, lectures are very clear, assignments are both challenging and educational (closely related to lecture materials). Thank you!
by YWOct 22, 2019
The lectures are good and elaborate. Some of the exercises are very confusing though.\n\nOverall a good introduction to data structures.
by YLNov 6, 2019
Good coverage. The lecturer and teaching stuff are knowledgeable and helpful. Would be better if the slides can have more details.
About University of Illinois at Urbana-Champaign
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.
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.
Frequently Asked Questions
When will I have access to the lectures and assignments?
Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.
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?
Is financial aid available?
More questions? Visit the Learner Help Center.