Preview Complete DSA Course - Basics to Advanced for Free

DSA - Course Introduction - What you will learn

Chapter 1: Course Overview and Curriculum Walkthrough

Curriculum Walkthrough

Chapter 2: Mastering Big O Notation and Complexity Analysis

Section Introduction

Complexity Analysis

Why We Need Big O Notation

Big O(n) Complexity

Big O(1) Complexity

Counting Operations

Simplifying Big O - Part 1

Big O(n^2) Complexity

Simplifying Big O - Part 2

Big O(n!) Complexity

Space Complexity – Part 1

Space Complexity – Part 2

Section Summary

Chapter 3: Essential Concepts - Memory Management & Logarithms

Memory

Logarithm

Chapter 4: Data Structures Introduction and Real-World Applications

Introduction to Data Structures

Chapter 5: Arrays Unlocked - Operations, Static vs Dynamic Arrays

Array Introduction

Array - Common Operations – Part 1

Array - Common Operations – Part 2

Static versus Dynamic Array - Common Operations – Part 3

Chapter 6: Linked Lists Demystified - Single, Double, and Circular

Linked Lists

Linked List Complexities

Doubly Linked List

Circular Linked List and Implementing a Linked List

Chapter 7: Mastering Stacks and Queues - Core Operations

Stack and Queue

Chapter 8: Unlocking Hash Tables - The Power of Key-Value Pairs

Hash Tables

Chapter 9: Trees Explained - Binary Trees, Search Trees, AVL, and Red-Black Trees

Trees - Part 1

Trees - Part 2

Binary Tree

Binary Search Tree

Adelson-Vekskii Landis (AVL) Trees versus Red Black Trees

Chapter 10: Heaps and Priority Queues - Efficient Sorting & Searching

Heaps

Heap Sort and Priority Queues

Chapter 11: Tries for Fast Data Retrieval - Structure and Importance

Trie - I

Trie - II

Why Are Tries Important

Chapter 12: Graphs and Networks - Concepts, Implementations, and Applications

Graphs

Chapter 13: Recursion Techniques - Call Stacks, Tree Recursion, and Practical Examples

What is Recursion

Recursion Control of a Function – Part 1

Recursion Tracing Tree – Part 2

Recursion Understanding a Call Stack – Part 3

Recursion Tree Recursion – Part 4

Recursion Example - Factorial of a Number

Chapter 14: Searching Algorithms - Linear vs Binary Search and Their Implementations

Linear Search

Binary Search

Binary Search Complexity

Implementing Binary Search – Part 1

Implementing Binary Search Implementation – Recursion – Part 2

Chapter 15: Elementary Sorting Algorithms - Bubble, Selection, and Insertion Sort

Sorting Algorithm – Introduction

Bubble Sort

Bubble Sort Visualization

Implementing Bubble Sort

Bubble Sort Complexity

Selection Sort

Selection Sort Visualization

Implementing Selection Sort

Selection Sort Complexity

Insertion Sort

Implementing Insertion Sort

Insertion Sort Complexity

Performance Analysis

Chapter 16: Advanced Sorting Techniques - Quick Sort and Merge Sort

Quick Sort

Quick Sort Complexity

Implementing Quicksort

Merge Sort

Merge Sort Complexity

Implementing Merge Sort

Chapter 17: Tree Traversal Techniques - Depth-First and Breadth-First Search

Tree Traversal

Depth-first Search – (Preorder, Inorder, and Postorder)

Implementing a Binary Tree

Implementing Depth-first Search

Depth-first Search Complexity

Breadth-first Search - Level Order

Implementing Breadth-first Search

Breadth-first Search Complexity

Chapter 18: Graph Traversal Algorithms - BFS, DFS, and Complexity Analysis

Graph Traversal

Implementing Graph Animation

Implementing Breadth-first Search

Implementing Depth-first Search

Graph Traversal Complexity

Chapter 19: Practical Implementations & Interview Preparation - Real-World Data Structures and Algorithms

Implementing Data Structures

Problem Solving Approach

Certificate

Preview - Complete DSA Course - Basics to Advanced for Free