0(0)

Algorithms the complete guide in 2020

  • Course level: Beginner

Description

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

What Will I 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.

Topics for this course

43 Lessons

Algorithms

Algorithms Course Introduction00:00:00
Algorithms Lecture 1 Part 1: Mathematical Preliminaries00:00:00
Algorithms Lecture 1 Part 2: Mathematical Preliminaries00:00:00
Algorithms Lecture 1 Part 3: Mathematical Preliminaries00:00:00
Algorithms Lecture 2 Part 1: Insertion Sort00:00:00
Algorithms Lecture 2 Part 1 Bubble Sort00:00:00
Algorithms Lecture 2 Part 1 Bubble Sort00:00:00
Algorithms Lecture 2 Part 2: Merge Sort00:00:00
Algorithms Lecture 2 Part 2: Merge Sort Complexity Analysis00:00:00
Algorithms Lecture 2 Part 3: Quicksort00:00:00
Shortest Paths and Dijkstra’s Algorithm: Part 100:00:00
Shortest Paths and Dijkstra’s Algorithm: Part 200:00:00
Shortest Paths and Dijkstra’s Algorithm: Part 3 – Example00:00:00
Spanning Trees and Forests: Part 100:00:00
Spanning Trees and Forests: Part 2 – Kruskal’s algorithm00:00:00
Spanning Trees and Forests: Part 3 – Prim’s algorithm00:00:00
Graphs and Digraphs: Part 100:00:00
Graphs and Digraphs: Part 200:00:00
Graphs and Digraphs: Part 400:00:00
Graphs and Digraphs: Part 500:00:00
Graphs and Digraphs: Part 600:00:00
Binary Search00:00:00
Associative Arrays and Hash Tables: Part 100:00:00
Associative Arrays and Hash Tables: Part 200:00:00
Binary Search Trees (BSTs): Part 100:00:00
Binary Search Trees (BSTs): Part 200:00:00
Binary Search Trees (BSTs): Part 300:00:00
Number Theory: Part 100:00:00
Number Theory: Part 2: Chinese Remainder Theorem00:00:00
Bellman-Ford Algorithm: Shortest Path Problem00:00:00
Dijkstra’s Algorithm: Shortest Path Problem00:00:00
Priority Queues, Heaps and Heapsort – Part A00:00:00
Priority Queues, Heaps and Heapsort – Part B00:00:00
Algorithms and Data Structures Part 1: Recursive Programming00:00:00
Algorithms and Data Structures Part 1: Insertion Sort00:00:00
Algorithms and Data Structures Part 1: Bubble Sort00:00:00
Algorithms and Data Structures Part 1: Linked Lists00:00:00
Algorithms and Data Structures: Part 1- Queues00:00:00
Introduction to Time-Complexity Analysis: Part A00:00:00
Introduction to Time-Complexity Analysis (Part B)00:00:00
Algorithms and Data Structures Part 1: Quicksort00:00:00
Algorithms and Data Structures Part 1: Mergesort00:00:00
Algorithms and Data Structures Part 1: Selection Sort00:00:00
Algorithms
Free

Enrolment validity: Lifetime