Easy to Advanced Data Structures

Easy to Advanced Data Structures, available at $69.99, has an average rating of 4.2, with 48 lectures, 12 quizzes, based on 7533 reviews, and has 89522 subscribers.

You will learn about 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 This course is ideal for individuals who are Individuals hungry for new knowledge or Students who want a fundamental understanding of data structures It is particularly useful for Individuals hungry for new knowledge or Students who want a fundamental understanding of data structures.

Enroll now: Easy to Advanced Data Structures

Summary

Title: Easy to Advanced Data Structures

Price: $69.99

Average Rating: 4.2

Number of Lectures: 48

Number of Quizzes: 12

Number of Published Lectures: 48

Number of Published Quizzes: 12

Number of Curriculum Items: 60

Number of Published Curriculum Objects: 60

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will 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

Who Should Attend

Individuals hungry for new knowledge
Students who want a fundamental understanding of data structures

Target Audiences

Individuals hungry for new knowledge
Students who want a fundamental understanding of data structures

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
AVL trees
Binary Indexed trees
Sparse tables

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.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Abstract data types Introduction

Lecture 2: Understanding time/space complexity

Chapter 2: Static and dynamic arrays

Lecture 1: Static and dynamic arrays

Lecture 2: Dynamic array source code

Chapter 3: Linked lists

Lecture 1: Linked list introduction

Lecture 2: Doubly linked list source code

Chapter 4: Stacks

Lecture 1: Understanding stacks

Lecture 2: Stack implementation details

Lecture 3: Stack source code

Chapter 5: Queues

Lecture 1: Understanding queues

Lecture 2: Breadth first search and queue implementation

Lecture 3: Queue source code

Chapter 6: Priority queues

Lecture 1: What is a priority queue?

Lecture 2: Min heaps and Max heaps

Lecture 3: Priority queue inserting elements

Lecture 4: Priority queue removing elements

Lecture 5: Priority queue source code

Chapter 7: Union find/Disjoint set

Lecture 1: Union find introduction

Lecture 2: Kruskal's Algorithm

Lecture 3: Union and find operations

Lecture 4: Path compression

Lecture 5: Union find source code

Chapter 8: Binary search trees

Lecture 1: Introduction to binary trees

Lecture 2: Binary search tree insertions

Lecture 3: Binary search tree removals

Lecture 4: Binary tree traversals

Lecture 5: Binary search tree source code

Chapter 9: Hash tables

Lecture 1: Hash table hash functions

Lecture 2: Hash table separate chaining

Lecture 3: Hash table separate chaining source code

Lecture 4: Hash table open addressing

Lecture 5: Hash table linear probing

Lecture 6: Hash table quadratic probing

Lecture 7: Hash table double hashing

Lecture 8: Hash table removing key-value pairs

Lecture 9: Hash table open addressing source code

Chapter 10: Fenwick tree/Binary indexed tree

Lecture 1: Fenwick tree range queries

Lecture 2: Fenwick tree point updates

Lecture 3: Fenwick tree construction

Lecture 4: Fenwick tree source code

Chapter 11: AVL Tree

Lecture 1: Tree rotations

Lecture 2: AVL tree insertions

Lecture 3: AVL tree removals

Lecture 4: AVL tree source code

Chapter 12: Indexed Priority Queue

Lecture 1: Introduction to indexed priority queues

Lecture 2: Indexed priority queue source code

Chapter 13: Sparse Tables

Lecture 1: Sparse Table

Lecture 2: Sparse Table Source Code

Instructors

William Fiset
Google engineer; ACM-ICPC world finalist

Rating Distribution

1 stars: 94 votes
2 stars: 179 votes
3 stars: 1177 votes
4 stars: 2800 votes
5 stars: 3283 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu