Course Overview

Training Options

Self-Paced Learning

$ 699

  • num_of_days days of access to high-quality, self-paced learning content designed by industry experts

Course Curriculum

Course Content

  • Section 01: Data Structures and Algorithms The Complete Masterclass

    Preview
    • Lesson 01: Course Introduction

      18:52Preview
      • 1.01 Course Introduction
        03:18
      • 1.02 Curriculum Walkthrough
        15:34
    • Lesson 02: Big O Notation

      52:07Preview
      • 2.01 Section Introduction
        01:43
      • 2.02 Complexity Analysis
        05:25
      • 2.03 Why We Need Big O Notation
        06:32
      • 2.04 Big O(n) Complexity
        07:47
      • 2.05 Big O(One) Complexity
        04:04
      • 2.06 Counting Operations
        03:32
      • 2.07 Simplifying Big O - Part One
        07:19
      • 2.08 Big O(n Caret Two) Complexity
        03:44
      • 2.09 Simplifying Big O - Part Two
        02:35
      • 2.10 Big O(n!) Complexity
        01:25
      • 2.11 Space Complexity - Part One
        04:39
      • 2.12 Space Complexity - Part Two
        01:44
      • 2.13 Section Summary
        01:38
    • Lesson 03: Essential Concepts

      22:37
      • 3.01 Memory
        11:25
      • 3.02 Logarithm
        11:12
    • Lesson 04: Data Structure - Introduction

      07:07
      • 4.01 Introduction to Data Structures
        07:07
    • Lesson 05: Data Structure - Arrays

      28:11
      • 5.01 Array Introduction
        04:40
      • 5.02 Array - Common Operations – Part One
        08:02
      • 5.03 Array - Common Operations – Part Two
        08:04
      • 5.04 Static versus Dynamic Array - Common Operations – Part Three
        07:25
    • Lesson 06: Data Structures – Linked Lists

      01:09:33Preview
      • 6.01 Linked Lists
        25:54
      • 6.02 Linked List Complexities
        20:43
      • 6.03 Doubly Linked List
        07:27
      • 6.04 Circular Linked List and Implementing a Linked List
        15:29
    • Lesson 07: Data Structures - Stack and Queue

      26:18
      • 7.01 Stack and Queue
        26:18
    • Lesson 08: Data Structures - Hash Tables

      34:42
      • 8.01 Hash Tables
        34:42
    • Lesson 09: Data Structures - Trees

      01:13:38Preview
      • 9.01 Trees - Part One
        17:32
      • 9.02 Trees - Part Two
        05:22
      • 9.03 Binary Tree
        13:49
      • 9.04 Binary Search Tree
        28:57
      • 9.05 Adelson-Vekskii Landis (AVL) Trees versus Red Black Trees
        07:58
    • Lesson 10: Data Structures - Heaps

      42:55
      • 10.01 Heaps
        29:05
      • 10.02 Heap Sort and Priority Queues
        13:50
    • Lesson 11: Data Structures - Tries

      36:36Preview
      • 11.01 Trie - One
        12:59
      • 11.02 Trie - Two
        20:33
      • 11.03 Why Are Tries Important
        03:04
    • Lesson 12: Data Structures - Graphs

      32:08
      • 12.01 Graphs
        32:08
    • Lesson 13: Essential Concepts - Two

      01:14:45Preview
      • 13.01 What is Recursion
        07:14
      • 13.02 Recursion Control of a Function - Part One
        07:00
      • 13.03 Recursion Tracing Tree - Part Two
        17:55
      • 13.04 Recursion Understanding a Call Stack - Part Three
        16:10
      • 13.05 Recursion Tree Recursion - Part Four
        18:48
      • 13.06 Recursion Example - Factorial of a Number
        07:38
    • Lesson 14: Algorithm Searching

      54:04
      • 14.01 Linear Search
        07:30
      • 14.02 Binary Search
        10:58
      • 14.03 Binary Search Complexity
        04:34
      • 14.04 Implementing Binary Search - Part One
        05:14
      • 14.05 Implementing Binary Search Implementation - Recursion - Part Two
        25:48
    • Lesson 15: Algorithm Sorting Elementary

      55:45Preview
      • 15.01 Sorting Algorithm - Introduction
        02:20
      • 15.02 Bubble Sort
        04:52
      • 15.03 Bubble Sort Visualization
        02:25
      • 15.04 Implementing Bubble Sort
        07:19
      • 15.05 Bubble Sort Complexity
        03:32
      • 15.06 Selection Sort
        04:11
      • 15.07 Selection Sort Visualization
        03:21
      • 15.08 Implementing Selection Sort
        06:59
      • 15.09 Selection Sort Complexity
        02:32
      • 15.10 Insertion Sort
        03:48
      • 15.11 Implementing Insertion Sort
        07:43
      • 15.12 Insertion Sort Complexity
        02:35
      • 15.13 Performance Analysis
        04:08
    • Lesson 16: Algorithm Sorting Advanced

      01:26:50Preview
      • 16.01 Quick Sort
        22:21
      • 16.02 Quick Sort Complexity
        12:52
      • 16.03 Implementing Quicksort
        10:58
      • 16.04 Merge Sort
        13:11
      • 16.05 Merge Sort Complexity
        05:37
      • 16.06 Implementing Merge Sort
        21:51
    • Lesson 17: Algorithm Tree Traversals

      01:28:43Preview
      • 17.01 Tree Traversal
        18:52
      • 17.02 Depth-first Search – (Preorder, Inorder, and Postorder)
        10:02
      • 17.03 Implementing a Binary Tree
        09:54
      • 17.04 Implementing Depth-first Search
        20:42
      • 17.05 Depth-first Search Complexity
        03:18
      • 17.06 Breadth-first Search - Level Order
        10:10
      • 17.07 Implementing Breadth-first Search
        13:26
      • 17.08 Breadth-first Search Complexity
        02:19
    • Lesson 18: Thank You for Being Here

      00:42
      • 18.01 Thank You for Being Here!
        00:42

Why Online Bootcamp

  • Develop skills for real career growthCutting-edge curriculum designed in guidance with industry and academia to develop job-ready skills
  • Learn from experts active in their field, not out-of-touch trainersLeading practitioners who bring current best practices and case studies to sessions that fit into your work schedule.
  • Learn by working on real-world problemsCapstone projects involving real world data sets with virtual labs for hands-on learning
  • Structured guidance ensuring learning never stops24x7 Learning support from mentors and a community of like-minded peers to resolve any conceptual doubts
  • Disclaimer
  • PMP, PMI, PMBOK, CAPM, PgMP, PfMP, ACP, PBA, RMP, SP, and OPM3 are registered marks of the Project Management Institute, Inc.