Ordered Data Structures
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.
Buy Now AED 274.99 + VAT
Monthly Subscription Starting at AED 99 + VAT
- Level Foundation
- المدة 19 ساعات hours
- الطبع بواسطة University of Illinois Urbana-Champaign
-
Offered by
عن
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.الوحدات
Orientation
-
2
Readings
-
1
Assignment
1
Assignment
- Orientation Quiz
2
Readings
- Syllabus
- Additional References for C++
Week 1 Information
-
2
Readings
2
Readings
- Week 1 Overview
- Downloading the Example C++ Source Code for Lecture with Git
Lesson 1: Linear Structures
-
6
Videos
6
Videos
- 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)
Week 1 Graded Activities
-
2
Readings
-
1
Programming
-
2
Assignment
- Linked Lists and Merge Sort Project
2
Assignment
- Week 1 Quiz
- Week 1 Challenge
2
Readings
- Important Tips and Notes for All Challenge Problems
- Guidelines for Asking for Help With Code
Week 2 Information
-
1
Readings
1
Readings
- Week 2 Overview
Lesson 2: Binary Search Trees (BST)
-
5
Videos
5
Videos
- 2.1 Tree Terminology
- 2.2 Binary Trees
- 2.3 Tree Traversals
- 2.4 Binary Search Trees
- 2.5 BST Analysis
Week 2 Graded Activities
-
2
Assignment
2
Assignment
- Week 2 Quiz
- Week 2 Challenge
Week 3 Information
-
1
Readings
1
Readings
- Week 3 Overview
Lesson 3.1: AVL Trees
-
2
Videos
2
Videos
- 3.1.1 Balanced BST
- 3.1.2 AVL Analysis
Lesson 3.2: B-Trees
-
3
Videos
3
Videos
- 3.2.1 B-Tree Introduction
- 3.2.2 B-Tree Insert
- 3.2.3 B-Tree Search
Week 3 Graded Activities
-
1
Programming
-
2
Assignment
- GenericTree and Tree Traversal Project
2
Assignment
- Week 3 Quiz
- Week 3 Challenge
Week 4 Information
-
1
Readings
1
Readings
- Week 4 Overview
Lesson 4: Heaps
-
5
Videos
5
Videos
- 4.1 Heap Introduction
- 4.2 Heap Insert
- 4.3 Heap - RemoveMIN
- 4.4 Heap - buildHeap
- 4.5 Heap - Runtime Analysis
Week 4 Graded Activities
-
2
Assignment
2
Assignment
- Week 4 Quiz
- Week 4 Challenge
Auto Summary
Discover how to efficiently store and retrieve ordered data with Coursera's "Ordered Data Structures" course. Perfect for IT and Computer Science enthusiasts, this foundational course covers arrays, linked lists, queues, stacks, trees, and more. Enhance your understanding through algorithm complexity analysis over 1140 minutes. Subscribe with the Starter option and elevate your data handling skills.
Wade Fagen-Ulmschneider