Learning Data Structures And Algorithms

Implementation and Analysis for Increased Software Performance

Last updated 2022-01-10 | 4.2

- Learn to analyze and implement common algorithms
- Learn about different types of Data Structures
- Complexity Theory

What you'll learn

Learn to analyze and implement common algorithms
Learn about different types of Data Structures
Complexity Theory

* Requirements

* This course is designed for the absolute beginner
* meaning no previous programming experience is required.

Description

In this Learning Data Structures and Algorithms training course, expert author Rod Stephens will teach you how to analyze and implement common algorithms used. 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 computer based 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.

Who this course is for:

  • Anyone interested in learning about Data structures and Algorithms

Course content

16 sections • 102 lectures

Important - Download These First - Working Files Preview 00:01

Introduction And Course Overview Preview 04:00

How To Access Your Working Files Preview 03:22

Complexity Theory Preview 03:56

Big O Notation Preview 07:02

Typical Runtime Functions Preview 04:37

Comparing Runtime Functions Preview 05:27

P And NP Preview 04:04

Random Numbers Preview 02:19

Linear Congruential Generators Preview 05:04

Randomizing Arrays - Part 1 - Randomization Algorithm Preview 03:47

Randomizing Arrays - Part 2 - Randomize Two-Dimensional Array Preview 04:31

GCD Preview 04:09

LCM Preview 03:28

Prime Factorization - Part 1 - Factor Preview 04:59

Prime Factorization - Part 2 - Factoring Algorithm Preview 02:43

Finding Primes Preview 03:24

Testing Primality Preview 03:45

Numerical Integration Preview 05:11

Singly Linked Lists - Part 1 - Explanation Preview 06:48

Singly Linked Lists - Part 2 - Sentinels Preview 02:22

Sorted Linked Lists Preview 03:22

Sorting With Linked Lists Preview 04:07

Doubly Linked Lists Preview 03:51

One-Dimensional Arrays Preview 05:10

Triangular Arrays - Part 1 - How to Build This Array Preview 04:13

Triangular Arrays - Part 2 Preview 03:17

Sparse Arrays - Part 1 - A linked List of Linked Lists Preview 05:27

Sparse Arrays - Part 2 Preview 03:19

Sorting Algorithms Preview 03:03

Insertionsort Preview 06:27

Selectionsort Preview 04:46

Quicksort - Part 1 - Fast Sorting Alogorithm Preview 05:40

Quicksort - Part 2 - Algorithm Runtime Behaviour Preview 07:55

Heapsort - Part 1 Preview 06:17

Heapsort - Part 2 Preview 05:21

Heapsort - Part 3 Preview 05:39

Mergesort - Part 1 Preview 03:55

Mergesort - Part 2 Preview 03:41

Bubblesort - Part 1 Preview 04:51

Bubblesort - Part 2 Preview 04:18

Countingsort - Part 1 Preview 04:45

Countingsort - Part 2 Preview 03:35

Sorting Summary Preview 02:51

Linear Search Preview 02:11

Binary Search Preview 05:15

Interpolation Search Preview 05:27

Hash Tables Preview 04:32

Chaining Preview 05:23

Open Addressing - Basics Preview 07:25

Open Addressing - Linear Probing Preview 04:48

Open Addressing - Quadratic Probing Preview 04:22

Open Addressing - Double Hashing Preview 05:55

Recursion Basics Preview 05:37

Fibonacci Numbers Preview 06:08

Tower Of Hanoi Preview 06:08

Koch Curves Preview 04:32

Hilbert Curves Preview 04:32

Gaskets Preview 04:52

Removing Tail Recursion Preview 03:58

Removing Recursion With Stacks Preview 03:56

Fixing Fibonacci Preview 07:25

Selections Preview 04:15

Permutations Preview 04:12

Backtracking Preview 06:03

The Eight Queens Problem - Part 1 - Test Your Skills Preview 06:00

The Eight Queens Problem - Part 2 - Eight Queens Algorithm Modification Preview 04:03

The Eight Queens Problem - Part 3 - Algorithm Modfication Preview 03:48

The Knights Tour Preview 04:20

Tree Terms Preview 05:06

Binary Tree Properties Preview 06:25

Traversals - Preorder Preview 03:54

Traversals - Postorder Preview 02:57

Traversals - Inorder Preview 02:47

Traversals - Breadth-First Preview 02:57

Building Sorted Trees Preview 03:56

Editing Sorted Trees Preview 04:36

Why Do You Need Balanced Trees? Preview 04:04

B-Trees - B-Tree Basics Preview 07:18

B-Trees - Adding Items Preview 05:16

B-Trees - Removing Items Preview 04:16

AVL Tress - Part 1 Preview 04:40

AVL Tress - Part 2 Preview 03:51

Network Terminology Preview 03:31

Network Classes Preview 04:52

Depth-First Traversal Preview 05:21

Breadth-First Traversal Preview 02:43

Spanning Trees - Part 1 Preview 04:12

Spanning Trees - Part 2 Preview 03:58

Shortest Paths - Part 1 Preview 07:27

Shortest Paths - Part 2 Preview 08:41

All Pairs Shortest Path - Part 1 Preview 03:38

All Pairs Shortest Path - Part 2 Preview 06:35