Learning Data Structures and Algorithms

Course Curriculum

Chapter 1: Introduction

Lecture 1: Important – Download These First – Working Files

Lecture 2: Introduction And Course Overview

Lecture 3: How To Access Your Working Files

Chapter 2: Complexity Theory

Lecture 1: Complexity Theory

Lecture 2: Big O Notation

Lecture 3: Typical Runtime Functions

Lecture 4: Comparing Runtime Functions

Lecture 5: P And NP

Chapter 3: Numerical Algorithms

Lecture 1: Random Numbers

Lecture 2: Linear Congruential Generators

Lecture 3: Randomizing Arrays – Part 1 – Randomization Algorithm

Lecture 4: Randomizing Arrays – Part 2 – Randomize Two-Dimensional Array

Lecture 5: GCD

Lecture 6: LCM

Lecture 7: Prime Factorization – Part 1 – Factor

Lecture 8: Prime Factorization – Part 2 – Factoring Algorithm

Lecture 9: Finding Primes

Lecture 10: Testing Primality

Lecture 11: Numerical Integration

Chapter 4: Linked Lists

Lecture 1: Singly Linked Lists – Part 1 – Explanation

Lecture 2: Singly Linked Lists – Part 2 – Sentinels

Lecture 3: Sorted Linked Lists

Lecture 4: Sorting With Linked Lists

Lecture 5: Doubly Linked Lists

Chapter 5: Arrays

Lecture 1: One-Dimensional Arrays

Lecture 2: Triangular Arrays – Part 1 – How to Build This Array

Lecture 3: Triangular Arrays – Part 2

Lecture 4: Sparse Arrays – Part 1 – A linked List of Linked Lists

Lecture 5: Sparse Arrays – Part 2

Chapter 6: Stacks And Queues

Lecture 1: Stacks

Lecture 2: Stack Algorithms

Lecture 3: Double Stacks

Lecture 4: Queues

Chapter 7: Sorting

Lecture 1: Sorting Algorithms

Lecture 2: Insertionsort

Lecture 3: Selectionsort

Lecture 4: Quicksort – Part 1 – Fast Sorting Alogorithm

Lecture 5: Quicksort – Part 2 – Algorithm Runtime Behaviour

Lecture 6: Heapsort – Part 1

Lecture 7: Heapsort – Part 2

Lecture 8: Heapsort – Part 3

Lecture 9: Mergesort – Part 1

Lecture 10: Mergesort – Part 2

Lecture 11: Bubblesort – Part 1

Lecture 12: Bubblesort – Part 2

Lecture 13: Countingsort – Part 1

Lecture 14: Countingsort – Part 2

Lecture 15: Sorting Summary

Chapter 8: Searching

Lecture 1: Linear Search

Lecture 2: Binary Search

Lecture 3: Interpolation Search

Chapter 9: Hash Tables

Lecture 1: Hash Tables

Lecture 2: Chaining

Lecture 3: Open Addressing – Basics

Lecture 4: Open Addressing – Linear Probing

Lecture 5: Open Addressing – Quadratic Probing

Lecture 6: Open Addressing – Double Hashing

Chapter 10: Recursion

Lecture 1: Recursion Basics

Lecture 2: Fibonacci Numbers

Lecture 3: Tower Of Hanoi

Lecture 4: Koch Curves

Lecture 5: Hilbert Curves

Lecture 6: Gaskets

Lecture 7: Removing Tail Recursion

Lecture 8: Removing Recursion With Stacks

Lecture 9: Fixing Fibonacci

Lecture 10: Selections

Lecture 11: Permutations

Chapter 11: Backtracking Algorithms

Lecture 1: Backtracking

Lecture 2: The Eight Queens Problem – Part 1 – Test Your Skills

Lecture 3: The Eight Queens Problem – Part 2 – Eight Queens Algorithm Modification

Lecture 4: The Eight Queens Problem – Part 3 – Algorithm Modfication

Lecture 5: The Knights Tour

Chapter 12: Trees

Lecture 1: Tree Terms

Lecture 2: Binary Tree Properties

Lecture 3: Traversals – Preorder

Lecture 4: Traversals – Postorder

Lecture 5: Traversals – Inorder

Lecture 6: Traversals – Breadth-First

Lecture 7: Building Sorted Trees

Lecture 8: Editing Sorted Trees

Chapter 13: Balanced Trees

Lecture 1: Why Do You Need Balanced Trees?

Lecture 2: B-Trees – B-Tree Basics

Lecture 3: B-Trees – Adding Items

Lecture 4: B-Trees – Removing Items

Lecture 5: AVL Tress – Part 1

Lecture 6: AVL Tress – Part 2