Data Structures using C# and .NET Core 3.0

Course Curriculum

Chapter 1: Introduction

Lecture 1: Intro

Lecture 2: What you'll learn

Lecture 3: What you'll need

Chapter 2: Big – O notation

Lecture 1: Introduction

Lecture 2: Time complexity 1

Lecture 3: Time complexity 2

Chapter 3: Arrays

Lecture 1: Arrays – Introduction

Lecture 2: Multidimensional arrays

Lecture 3: Summing the elements of an array

Lecture 4: Jagged arrays

Lecture 5: Predefined Array methods

Lecture 6: Predefined Array methods 2

Lecture 7: Predefined Array methods 3

Lecture 8: Reversing and array

Lecture 9: Check if a string is a palindrome

Lecture 10: Dynamic Arrays – List<T> data type

Lecture 11: Arrays – Summary

Chapter 4: Linked Lists

Lecture 1: Intro

Lecture 2: Implementing a Node

Lecture 3: Implementing Append

Lecture 4: Implementing Prepend and Find

Lecture 5: Implementing Insert

Lecture 6: Implementing Remove

Lecture 7: Detecting loops

Lecture 8: Reversing a Linked List

Lecture 9: Doubly Linked Lists

Lecture 10: Implementing a Doubly Linked List

Chapter 5: Stacks

Lecture 1: Stack – Introduction

Lecture 2: Stack implementation with Arrays

Lecture 3: Stack implementation with Linked Lists

Chapter 6: Queues

Lecture 1: Queue – Introduction

Lecture 2: Queue implementation – Analysis

Lecture 3: Queue implementation using Arrays

Lecture 4: Queue implementation using Linked Lists

Chapter 7: Hashtables

Lecture 1: Hashtable – Introduction

Lecture 2: Hashtable – Implementation

Lecture 3: Collisions – Open addressing

Lecture 4: Collisions – Implementing Linear Probing

Lecture 5: Collisions – Chaining

Lecture 6: Collisions – Implementing Chaining

Chapter 8: Graphs

Lecture 1: Graphs – Introduction

Lecture 2: Adjacency matrix representation

Lecture 3: Adjacency matrix implementation

Lecture 4: Adjacency list representation

Lecture 5: Adjacency list implementation

Chapter 9: Trees

Lecture 1: Trees – Introduction

Lecture 2: Implementing a tree

Lecture 3: General Tree

Lecture 4: Implementing a General Tree

Lecture 5: Binary Tree

Lecture 6: BST (Binary Search Tree)

Lecture 7: BST – Implementing Add()

Lecture 8: BST – Implementing Search()

Lecture 9: BST – Delete

Lecture 10: BST – Implementing Delete()

Lecture 11: Tree rotations

Lecture 12: Implementing LeftRotate and RightRotate

Lecture 13: Calling LeftRotate and RightRotate

Lecture 14: AVL Tree – Updating Insert

Lecture 15: AVL Tree – Updating Delete

Chapter 10: Conclusion

Lecture 1: Conclusion