UIUC - Ordered Data Structures
- Offered byCoursera
Ordered Data Structures at Coursera Overview
Duration | 19 hours |
Start from | Start Now |
Total fee | Free |
Mode of learning | Online |
Official Website | Explore Free Course |
Credential | Certificate |
Ordered Data Structures at Coursera Highlights
- Earn a certificate from the University of Illinois at Urbana-Champaign upon completion of course.
- Self-Paced Learning Option.
Ordered Data Structures at Coursera Course details
- 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.
Ordered Data Structures at Coursera Curriculum
Orientation; Linear Structures
1.1 Arrays
1.2 Linked Memory
1.3 Run Time Analysis
1.4 Array and List Operations
1.5 Queue (Data Structure)
1.6 Stack (Data Structure)
Syllabus
Additional References for C++
Week 1 Overview
Downloading the Example C++ Source Code for Lecture with Git
Important Tips and Notes for All Challenge Problems
Guidelines for Asking for Help With Code
Orientation Quiz
Week 1 Quiz
Week 1 Challenge
Introduction to Tree Structures
2.1 Tree Terminology
2.2 Binary Trees
2.3 Tree Traversals
2.4 Binary Search Trees
2.5 BST Analysis
Week 2 Overview
Week 2 Quiz
Week 2 Challenge
Advanced Tree Structures
3.1.1 Balanced BST
3.1.2 AVL Analysis
3.2.1 B-Tree Introduction
3.2.2 B-Tree Insert
3.2.3 B-Tree Search
Week 3 Overview
Week 3 Quiz
Week 3 Challenge
Heap Structures
4.1 Heap Introduction
4.2 Heap Insert
4.3 Heap - RemoveMIN
4.4 Heap - buildHeap
4.5 Heap - Runtime Analysis
Week 4 Overview
Week 4 Quiz
Week 4 Challenge