Algorithms the complete guide in 2020

Wishlist Share
Share Course
Page Link
Share On Social Media

About Course

Algorithms

You will start by learning about the complexity theory, then jump into learning about the 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:

  1. Anyone interested in learning about Data structures and Algorithm
Show More

What Will You Learn?

  • This course will lay a solid foundation on which you can develop and analyze your algorithms.
  • You will learn to measure the performance of your algorithm in terms of the standard notations used in the industry.

Course Content

Algorithms

  • Algorithms Course Introduction
    00:00
  • Algorithms Lecture 1 Part 1: Mathematical Preliminaries
    00:00
  • Algorithms Lecture 1 Part 2: Mathematical Preliminaries
    00:00
  • Algorithms Lecture 1 Part 3: Mathematical Preliminaries
    00:00
  • Algorithms Lecture 2 Part 1: Insertion Sort
    00:00
  • Algorithms Lecture 2 Part 1 Bubble Sort
    00:00
  • Algorithms Lecture 2 Part 1 Bubble Sort
    00:00
  • Algorithms Lecture 2 Part 2: Merge Sort
    00:00
  • Algorithms Lecture 2 Part 2: Merge Sort Complexity Analysis
    00:00
  • Algorithms Lecture 2 Part 3: Quicksort
    00:00
  • Shortest Paths and Dijkstra’s Algorithm: Part 1
    00:00
  • Shortest Paths and Dijkstra’s Algorithm: Part 2
    00:00
  • Shortest Paths and Dijkstra’s Algorithm: Part 3 – Example
    00:00
  • Spanning Trees and Forests: Part 1
    00:00
  • Spanning Trees and Forests: Part 2 – Kruskal’s algorithm
    00:00
  • Spanning Trees and Forests: Part 3 – Prim’s algorithm
    00:00
  • Graphs and Digraphs: Part 1
    00:00
  • Graphs and Digraphs: Part 2
    00:00
  • Graphs and Digraphs: Part 4
    00:00
  • Graphs and Digraphs: Part 5
    00:00
  • Graphs and Digraphs: Part 6
    00:00
  • Binary Search
    00:00
  • Associative Arrays and Hash Tables: Part 1
    00:00
  • Associative Arrays and Hash Tables: Part 2
    00:00
  • Binary Search Trees (BSTs): Part 1
    00:00
  • Binary Search Trees (BSTs): Part 2
    00:00
  • Binary Search Trees (BSTs): Part 3
    00:00
  • Number Theory: Part 1
    00:00
  • Number Theory: Part 2: Chinese Remainder Theorem
    00:00
  • Bellman-Ford Algorithm: Shortest Path Problem
    00:00
  • Dijkstra’s Algorithm: Shortest Path Problem
    00:00
  • Priority Queues, Heaps and Heapsort – Part A
    00:00
  • Priority Queues, Heaps and Heapsort – Part B
    00:00
  • Algorithms and Data Structures Part 1: Recursive Programming
    00:00
  • Algorithms and Data Structures Part 1: Insertion Sort
    00:00
  • Algorithms and Data Structures Part 1: Bubble Sort
    00:00
  • Algorithms and Data Structures Part 1: Linked Lists
    00:00
  • Algorithms and Data Structures: Part 1- Queues
    00:00
  • Introduction to Time-Complexity Analysis: Part A
    00:00
  • Introduction to Time-Complexity Analysis (Part B)
    00:00
  • Algorithms and Data Structures Part 1: Quicksort
    00:00
  • Algorithms and Data Structures Part 1: Mergesort
    00:00
  • Algorithms and Data Structures Part 1: Selection Sort
    00:00

Student Ratings & Reviews

No Review Yet
No Review Yet
ResearcherStore

Want to receive push notifications for all major on-site activities?