This course is designed for those interested to learn about basic data structures. Read more.
William is a software engineer at Google stationed in MTV California. He graduated with an honors degree in Math/CS and now teaches with skill success
Access all courses in our library for only $9/month with All Access Pass
Get Started with All Access PassBuy Only This CourseAbout This Course
Who this course is for:
- Individuals hungry for new knowledge
- Students who want a fundamental understanding of data structures
What you’ll learn:
- Mature understanding of data structures
- Algorithms associated with data structures
- Dynamic arrays
- Singly and doubly linked list
- Queues & Stacks
- Binary Trees and Binary search trees
- Heaps & Priority queues
- Union find/Disjoint set
- Hash table/Associative array
- Fenwick tree/Binary indexed tree
Requirements:
- Basic computer science knowledge
Data structures are amongst the most fundamental ingredients in the recipe for creating efficient algorithms and good software design. Knowledge of how to create and design good data structures is an essential skill required in becoming an exemplary programmer. This course will teach you how to master the fundamental ideas surrounding data structures.
Learn and master the most common data structures in this comprehensive course:
- Static and dynamic arrays
- Singly and doubly linked lists
- Stacks
- Queues
- Heaps/Priority Queues
- Binary Trees/Binary Search Trees
- Union find/Disjoint Set
- Hash tables
- Fenwick trees
Course contents
This course provides you with high quality animated videos explaining a multitude of data structures and how they are represented visually. You will learn how to code various data structures together with simple to follow step-by-step instructions. Every data structure presented will be accompanied by some working source code (in Java) to solidify your understanding of that particular data structure. I will also be posting various coding exercises and multiple choice questions to ensure that you get some hands on experience.
Our Promise to You
By the end of this course, you will have learned about advanced data structures.
10 Day Money Back Guarantee. If you are unsatisfied for any reason, simply contact us and we’ll give you a full refund. No questions asked.
Get started today and learn more about advanced data structures.
Course Curriculum
| Section 1 - Introduction | |||
| Abstract Data Types Introduction | 00:00:00 | ||
| Understanding Time/Space Complexity | 00:00:00 | ||
| Section 2 - Static And Dynamic Arrays | |||
| Static And Dynamic Arrays | 00:00:00 | ||
| Dynamic Array Source Code | 00:00:00 | ||
| Section 3 - Linked Lists | |||
| Linked List Introduction | 00:00:00 | ||
| Doubly Linked List Source Code | 00:00:00 | ||
| Section 4 - Stacks | |||
| Understanding Stacks | 00:00:00 | ||
| Stack Implementation Details | 00:00:00 | ||
| Stack Source Code | 00:00:00 | ||
| Section 5 - Queues | |||
| Understanding Queues | 00:00:00 | ||
| Breadth First Search And Queue Implementation | 00:00:00 | ||
| Queue Source Code | 00:00:00 | ||
| Section 6 - Priority Queues | |||
| What Is A Priority Queue? | 00:00:00 | ||
| Min Heaps And Max Heaps | 00:00:00 | ||
| Priority Queue Inserting Elements | 00:00:00 | ||
| Priority Queue Removing Elements | 00:00:00 | ||
| Priority Queue Source Code | 00:00:00 | ||
| Section 7 - Union Find/Disjoint Set | |||
| Union Find Introduction | 00:00:00 | ||
| Kruskal's Algorithm | 00:00:00 | ||
| Union And Find Operations | 00:00:00 | ||
| Path compression | 00:00:00 | ||
| Union Find Source Code | 00:00:00 | ||
| Section 8 - Binary Search Trees | |||
| Introduction To Binary Trees | 00:00:00 | ||
| Binary Search Tree Insertions | 00:00:00 | ||
| Binary Search Tree Removals | 00:00:00 | ||
| Binary Tree Traversals | 00:00:00 | ||
| Binary Search Tree Source Code | 00:00:00 | ||
| Section 9 - Hash Tables | |||
| Hash Table Hash Functions | 00:00:00 | ||
| Hash Table Separate Chaining | 00:00:00 | ||
| Hash Table Separate Chaining Source Code | 00:00:00 | ||
| Hash Table Open Addressing | 00:00:00 | ||
| Hash table Linear Probing | 00:00:00 | ||
| Hash Table Quadratic Probing | 00:00:00 | ||
| Hash Table Double Hashing | 00:00:00 | ||
| Hash Table Removing Key-Value Pairs | 00:00:00 | ||
| Hash Table Open Addressing Source Code | 00:00:00 | ||
| Section 10 - Fenwick Tree/Binary Indexed Tree | |||
| Fenwick Tree Range Queries | 00:00:00 | ||
| Fenwick Tree Point Updates | 00:00:00 | ||
| Fenwick Tree Construction | 00:00:00 | ||
| Fenwick Tree Source Code | 00:00:00 | ||
| Section 11 - AVL Tree | |||
| Tree Rotations | 00:00:00 | ||
| AVL Tree Insertions | 00:00:00 | ||
| AVL Tree Removals | 00:00:00 | ||
| AVL Tree Source Code | 00:00:00 | ||
About This Course
Who this course is for:
- Individuals hungry for new knowledge
- Students who want a fundamental understanding of data structures
What you’ll learn:
- Mature understanding of data structures
- Algorithms associated with data structures
- Dynamic arrays
- Singly and doubly linked list
- Queues & Stacks
- Binary Trees and Binary search trees
- Heaps & Priority queues
- Union find/Disjoint set
- Hash table/Associative array
- Fenwick tree/Binary indexed tree
Requirements:
- Basic computer science knowledge
Data structures are amongst the most fundamental ingredients in the recipe for creating efficient algorithms and good software design. Knowledge of how to create and design good data structures is an essential skill required in becoming an exemplary programmer. This course will teach you how to master the fundamental ideas surrounding data structures.
Learn and master the most common data structures in this comprehensive course:
- Static and dynamic arrays
- Singly and doubly linked lists
- Stacks
- Queues
- Heaps/Priority Queues
- Binary Trees/Binary Search Trees
- Union find/Disjoint Set
- Hash tables
- Fenwick trees
Course contents
This course provides you with high quality animated videos explaining a multitude of data structures and how they are represented visually. You will learn how to code various data structures together with simple to follow step-by-step instructions. Every data structure presented will be accompanied by some working source code (in Java) to solidify your understanding of that particular data structure. I will also be posting various coding exercises and multiple choice questions to ensure that you get some hands on experience.
Our Promise to You
By the end of this course, you will have learned about advanced data structures.
10 Day Money Back Guarantee. If you are unsatisfied for any reason, simply contact us and we’ll give you a full refund. No questions asked.
Get started today and learn more about advanced data structures.
Course Curriculum
| Section 1 - Introduction | |||
| Abstract Data Types Introduction | 00:00:00 | ||
| Understanding Time/Space Complexity | 00:00:00 | ||
| Section 2 - Static And Dynamic Arrays | |||
| Static And Dynamic Arrays | 00:00:00 | ||
| Dynamic Array Source Code | 00:00:00 | ||
| Section 3 - Linked Lists | |||
| Linked List Introduction | 00:00:00 | ||
| Doubly Linked List Source Code | 00:00:00 | ||
| Section 4 - Stacks | |||
| Understanding Stacks | 00:00:00 | ||
| Stack Implementation Details | 00:00:00 | ||
| Stack Source Code | 00:00:00 | ||
| Section 5 - Queues | |||
| Understanding Queues | 00:00:00 | ||
| Breadth First Search And Queue Implementation | 00:00:00 | ||
| Queue Source Code | 00:00:00 | ||
| Section 6 - Priority Queues | |||
| What Is A Priority Queue? | 00:00:00 | ||
| Min Heaps And Max Heaps | 00:00:00 | ||
| Priority Queue Inserting Elements | 00:00:00 | ||
| Priority Queue Removing Elements | 00:00:00 | ||
| Priority Queue Source Code | 00:00:00 | ||
| Section 7 - Union Find/Disjoint Set | |||
| Union Find Introduction | 00:00:00 | ||
| Kruskal's Algorithm | 00:00:00 | ||
| Union And Find Operations | 00:00:00 | ||
| Path compression | 00:00:00 | ||
| Union Find Source Code | 00:00:00 | ||
| Section 8 - Binary Search Trees | |||
| Introduction To Binary Trees | 00:00:00 | ||
| Binary Search Tree Insertions | 00:00:00 | ||
| Binary Search Tree Removals | 00:00:00 | ||
| Binary Tree Traversals | 00:00:00 | ||
| Binary Search Tree Source Code | 00:00:00 | ||
| Section 9 - Hash Tables | |||
| Hash Table Hash Functions | 00:00:00 | ||
| Hash Table Separate Chaining | 00:00:00 | ||
| Hash Table Separate Chaining Source Code | 00:00:00 | ||
| Hash Table Open Addressing | 00:00:00 | ||
| Hash table Linear Probing | 00:00:00 | ||
| Hash Table Quadratic Probing | 00:00:00 | ||
| Hash Table Double Hashing | 00:00:00 | ||
| Hash Table Removing Key-Value Pairs | 00:00:00 | ||
| Hash Table Open Addressing Source Code | 00:00:00 | ||
| Section 10 - Fenwick Tree/Binary Indexed Tree | |||
| Fenwick Tree Range Queries | 00:00:00 | ||
| Fenwick Tree Point Updates | 00:00:00 | ||
| Fenwick Tree Construction | 00:00:00 | ||
| Fenwick Tree Source Code | 00:00:00 | ||
| Section 11 - AVL Tree | |||
| Tree Rotations | 00:00:00 | ||
| AVL Tree Insertions | 00:00:00 | ||
| AVL Tree Removals | 00:00:00 | ||
| AVL Tree Source Code | 00:00:00 | ||
Related Courses
Are you interested in higher education?
All Rights Reserved