by | Released February 2015 | ISBN: 9781771373470

In this Learning Data Structures and Algorithms video training course, Rod Stephens will teach you how to analyze and implement common algorithms used in data processing. This course is designed for the absolute beginner, meaning no previous programming experience is required.You will start by learning about the complexity theory, then jump into learning about numerical algorithms, including randomizing arrays, prime factorization, and numerical integration. From there, Rod will teach you about linked lists, such as singly linked lists, sorted, and doubly linked lists. This video tutorial also covers arrays, stacks and queues, and sorting. You will also learn about searching, hash tables, recursion, and backtracking algorithms. Finally, you will cover trees, balanced trees, decision trees, and network algorithms.Once you have completed this video training course, you will be fully capable of analyzing and implementing algorithms, as well as be able to select the best algorithm for various situations. Working files are included, allowing you to follow along with the author throughout the lessons. Show and hide more Publisher resources Download Example Code

1. Chapter 1 - Introduction
   • Introduction And Course Overview 00:04:01
   • About The Author 00:01:16
2. Chapter 2 - Complexity Theory
   • Complexity Theory 00:03:56
   • Big O Notation 00:07:03
   • Typical Runtime Functions 00:04:37
   • Comparing Runtime Functions 00:05:27
   • P And NP 00:04:04
3. Chapter 3 - Numerical Algorithms
   • Random Numbers 00:02:19
   • Linear Congruential Generators 00:05:04
   • Randomizing Arrays - Part 1 00:03:47
   • Randomizing Arrays - Part 2 00:04:31
   • GCD 00:04:09
   • LCM 00:03:29
   • Prime Factorization - Part 1 00:04:59
   • Prime Factorization - Part 2 00:02:43
   • Finding Primes 00:03:24
   • Testing Primality 00:03:46
   • Numerical Integration 00:05:11
4. Chapter 4 - Linked Lists
   • Singly Linked Lists - Part 1 00:06:48
   • Singly Linked Lists - Part 2 00:02:23
   • Sorted Linked Lists 00:03:23
   • Sorting With Linked Lists 00:04:08
   • Doubly Linked Lists 00:03:52
5. Chapter 5 - Arrays
   • One-Dimensional Arrays 00:05:10
   • Triangular Arrays - Part 1 00:04:13
   • Triangular Arrays - Part 2 00:03:18
   • Sparse Arrays - Part 1 00:05:28
   • Sparse Arrays - Part 2 00:03:20
6. Chapter 6 - Stacks And Queues
   • Stacks 00:02:33
   • Stack Algorithms 00:03:27
   • Double Stacks 00:02:09
   • Queues 00:05:49
7. Chapter 7 - Sorting
   • Sorting Algorithms 00:03:04
   • Insertionsort 00:06:28
   • Selectionsort 00:04:47
   • Quicksort - Part 1 00:05:40
   • Quicksort - Part 2 00:07:55
   • Heapsort - Part 1 00:06:17
   • Heapsort - Part 2 00:05:21
   • Heapsort - Part 3 00:05:40
   • Mergesort - Part 1 00:03:56
   • Mergesort - Part 2 00:03:41
   • Bubblesort - Part 1 00:04:51
   • Bubblesort - Part 2 00:04:18
   • Countingsort - Part 1 00:04:46
   • Countingsort - Part 2 00:03:35
   • Sorting Summary 00:02:51
8. Chapter 8 - Searching
   • Linear Search 00:02:12
   • Binary Search 00:05:15
   • Interpolation Search 00:05:27
9. Chapter 9 - Hash Tables
   • Hash Tables 00:04:33
   • Chaining 00:05:24
   • Open Addressing - Basics 00:07:26
   • Open Addressing - Linear Probing 00:04:48
   • Open Addressing - Quadratic Probing 00:04:23
   • Open Addressing - Double Hashing 00:05:56
10. Chapter 10 - Recursion
    • Recursion Basics 00:05:37
    • Fibonacci Numbers 00:06:08
    • Tower Of Hanoi 00:06:08
    • Koch Curves 00:04:32
    • Hilbert Curves 00:04:32
    • Gaskets 00:04:52
    • Removing Tail Recursion 00:03:59
    • Removing Recursion With Stacks 00:03:56
    • Fixing Fibonacci 00:07:25
    • Selections 00:04:16
    • Permutations 00:04:12
11. Chapter 11 - Backtracking Algorithms
    • Backtracking 00:06:04
    • The Eight Queens Problem - Part 1 00:06:01
    • The Eight Queens Problem - Part 2 00:04:04
    • The Eight Queens Problem - Part 3 00:03:49
    • The Knights Tour 00:04:21
12. Chapter 12 - Trees
    • Tree Terms 00:05:06
    • Binary Tree Properties 00:06:25
    • Traversals - Preorder 00:03:55
    • Traversals - Postorder 00:02:57
    • Traversals - Inorder 00:02:48
    • Traversals - Breadth-First 00:02:58
    • Building Sorted Trees 00:03:56
    • Editing Sorted Trees 00:04:36
13. Chapter 13 - Balanced Trees
    • Why Do You Need Balanced Trees? 00:04:04
    • B-Trees - B-Tree Basics 00:07:19
    • B-Trees - Adding Items 00:05:16
    • B-Trees - Removing Items 00:04:16
14. Chapter 14 - Decision Trees
    • Definition 00:05:37
    • Exhaustive Search 00:06:27
    • Branch And Bound 00:08:26
    • Heuristics 00:07:38
15. Chapter 15 - Network Algorithms
    • Network Terminology 00:03:32
    • Network Classes 00:04:53
    • Depth-First Traversal 00:05:21
    • Breadth-First Traversal 00:02:44
    • Spanning Trees - Part 1 00:04:13
    • Spanning Trees - Part 2 00:03:58
    • Shortest Paths - Part 1 00:07:27
    • Shortest Paths - Part 2 00:08:42
16. Chapter 16 - Wrap-Up
    • Wrap-Up 00:01:17
Show and hide more