Learning Data Structures and Algorithms

Duration: 7 hours 32 minutes

Chapter 1 - Introduction
Introduction And Course Overview
About The Author
How To Access Your Working Files
Chapter 2 - Complexity Theory
Complexity Theory
Big O Notation
Typical Runtime Functions
Comparing Runtime Functions
P And NP
Chapter 3 - Numerical Algorithms
Random Numbers
Linear Congruential Generators
Randomizing Arrays - Part 1
Randomizing Arrays - Part 2
GCD
LCM
Prime Factorization - Part 1
Prime Factorization - Part 2
Finding Primes
Testing Primality
Numerical Integration
Chapter 4 - Linked Lists
Singly Linked Lists - Part 1
Singly Linked Lists - Part 2
Sorted Linked Lists
Sorting With Linked Lists
Doubly Linked Lists
Chapter 5 - Arrays
One-Dimensional Arrays
Triangular Arrays - Part 1
Triangular Arrays - Part 2
Sparse Arrays - Part 1
Sparse Arrays - Part 2
Chapter 6 - Stacks And Queues
Stacks
Stack Algorithms
Double Stacks
Queues
Chapter 7 - Sorting
Sorting Algorithms
Insertionsort
Selectionsort
Quicksort - Part 1
Quicksort - Part 2
Heapsort - Part 1
Heapsort - Part 2
Heapsort - Part 3
Mergesort - Part 1
Mergesort - Part 2
Bubblesort - Part 1
Bubblesort - Part 2
Countingsort - Part 1
Countingsort - Part 2
Sorting Summary
Chapter 8 - Searching
Linear Search
Binary Search
Interpolation Search
Chapter 9 - Hash Tables
Hash Tables
Chaining
Open Addressing - Basics
Open Addressing - Linear Probing
Open Addressing - Quadratic Probing
Open Addressing - Double Hashing
Chapter 10 - Recursion
Recursion Basics
Fibonacci Numbers
Tower Of Hanoi
Koch Curves
Hilbert Curves
Gaskets
Removing Tail Recursion
Removing Recursion With Stacks
Fixing Fibonacci
Selections
Permutations
Chapter 11 - Backtracking Algorithms
Backtracking
The Eight Queens Problem - Part 1
The Eight Queens Problem - Part 2
The Eight Queens Problem - Part 3
The Knights Tour
Chapter 12 - Trees
Tree Terms
Binary Tree Properties
Traversals - Preorder
Traversals - Postorder
Traversals - Inorder
Traversals - Breadth-First
Building Sorted Trees
Editing Sorted Trees
Chapter 13 - Balanced Trees
Why Do You Need Balanced Trees?
B-Trees - B-Tree Basics
B-Trees - Adding Items
B-Trees - Removing Items
Chapter 14 - Decision Trees
Definition
Exhaustive Search
Branch And Bound
Heuristics
Chapter 15 - Network Algorithms
Network Terminology
Network Classes
Depth-First Traversal
Breadth-First Traversal
Spanning Trees - Part 1
Spanning Trees - Part 2
Shortest Paths - Part 1
Shortest Paths - Part 2
Chapter 16 - Wrap-Up
Wrap-Up

Bonus

Algorithms and Data Structures Part 1
Duration 3h 13m

Algorithms and Data Structures Part 2
Duration 2h 30m

======================================================================

This DVDs are only suitable for a PC/laptop/Mac; it WILL NOT play on a TV

=======================================================================