Data Structure & Algo in C++ with Free Prerequisite Videos

Course Curriculum

Chapter 1: Course Introduction

Lecture 1: Introduction

Chapter 2: Prerequisite Fundamentals Required for Data Structure

Lecture 1: Visual Studio Code Installation and Configuration

Lecture 2: How to print and format output in C++

Lecture 3: Variables Concept

Lecture 4: Interesting Facts about Varables in C++

Lecture 5: How to take input in C++

Lecture 6: Interesting Facts and Common Errors while taking Input in C++

Lecture 7: Operators in C++

Lecture 8: If-Else concept in C++ (Conditional Decision Control Statement)

Lecture 9: Interesting Facts and Important Things to Know about If- else Statement

Lecture 10: If else Practice Problems

Lecture 11: Loops Concepts and its Use in C++

Lecture 12: Loops Practice Problems

Lecture 13: Nested Loops in C++

Lecture 14: Switch Case in C++

Lecture 15: Introduction to Functions

Lecture 16: Function Importance with Code and Real world Example

Lecture 17: Function with Reference variable C++

Lecture 18: How to code Menu Driven Program?

Lecture 19: Class Concept in C++

Chapter 3: Array (Static & Linear Data Structure)

Lecture 1: Introduction to Array

Lecture 2: Array as an ADT

Lecture 3: Multi Dimentional Arrays

Lecture 4: Address Calculation of Array Elements

Chapter 4: Recursion Concept

Lecture 1: Introduction to Recursion

Lecture 2: Types of Recurssion

Chapter 5: Pointers and Structures in C++

Lecture 1: Structure Concept (a User Define Data Type in C++)

Lecture 2: Pointers in C++ with Memory Representation

Lecture 3: Dynamic memory allocation using Pointers

Chapter 6: Complexity Analysis and Types of Data Structure

Lecture 1: Introduction and Types of Data Structure

Lecture 2: Analysis-of-complexity

Lecture 3: Step Count Method

Lecture 4: Programming Constructs

Chapter 7: Linked List Data Structure

Lecture 1: Singly Linked List – Creation and display

Lecture 2: Singly Link List – Insertion

Lecture 3: Singly Linked List – Deletion Operation

Lecture 4: Singly Linked List – Search Operation

Lecture 5: Doubly Linked List – Creation and Display Operation

Lecture 6: Doubly Linked List – Insertion and Deletion Operation

Lecture 7: Circular Linked List

Chapter 8: Searching Techniques with Theory, Code, Analysis and Simple Tricks

Lecture 1: Linear Search

Lecture 2: Binary Search

Lecture 3: Index Sequential Search – Theory and examples

Lecture 4: Index Sequential Search – Code and Analysis

Lecture 5: Sentinel Search

Lecture 6: Fibonacci Search

Chapter 9: Sorting Techniques with Theory, Code, Analysis and Simple Tricks

Lecture 1: Bubble sort – Theory and Examples

Lecture 2: Bubble Sort Code and Analysis

Lecture 3: Selection Sort – Theory and Examples

Lecture 4: Selection Sort Code and Analysis

Lecture 5: Insertion Sort – Theory and Examples

Lecture 6: Insertion Sort Code and Analysis

Lecture 7: Quick Sort – Theory and Examples

Lecture 8: Quick Sort – Code and Analysis

Lecture 9: Merge Sort – Theory and Examples

Lecture 10: Merge Sort – Code and Analysis

Lecture 11: Shell Sort

Lecture 12: Counting_Sort

Lecture 13: Radix Sort

Lecture 14: Bucket Sort

Chapter 10: Sparse Matrix with Theopry and Examples

Lecture 1: Introduction and Need of Sparse Matrix

Lecture 2: Simple Transpose of Sparse Matrix

Lecture 3: Fast Transpose of Sparse Matrix

Lecture 4: Addition of Transpose of Sparse Matrix with Theopry and Examples

Lecture 5: Addition of Transpose of Sparse Matrix with Code

Chapter 11: Polynomial Operations Using Array Data Structure with Theory, Examples and Code

Lecture 1: Introduction to Plynomials Using Array Data Structure

Lecture 2: Plynomials Addition Using Array Data Structure

Lecture 3: Multiplication of Plynomials Using Array Data Structure

Chapter 12: Stack Data Structure

Lecture 1: Introduction and Implementation of Stack Data Structure using Array

Lecture 2: Implementation of Stack Data Structure using Linked List

Lecture 3: Stack as an ADT

Lecture 4: Conversion Techniques (Infix to Prefix & Postfix) in Stack Data Structure

Lecture 5: Expression Evaluation using Stack Data Structure

Chapter 13: Queue Data Structure with Theory, Examples and Code

Lecture 1: Queue Introduction and Implementation using Array (Creation, Insertion, Deletion

Lecture 2: Queue Introduction and Implementation using Linked List ( with CURD Operation)

Lecture 3: Double Ended Queue (DeQueue) Implementation (Insertion & Deletion from Both End)

Lecture 4: Circular Queue Introduction and Implementation (CURD Operation)

Chapter 14: Tree Data Structure with Theory, Code, Examples and Simples Tricks and Tips

Lecture 1: Binary Tree Creation Using Traversing Techniques (Preorder, Inorder & Postorder)

Lecture 2: Binary Tree Traversing Techniques (Preorder, Inorder and Postorder)

Lecture 3: Preorder Traversing Algorithm with its Implementation ( Non Recursive Approach )

Lecture 4: Preorder Traversing Algorithm with its Implementation ( Recursive Approach )

Lecture 5: Inorder and Postorder Traversing Algorithm with its Implementation

Lecture 6: Binary Search Tree (BST) Creation, Insertion, Deletion and Searching Operation

Lecture 7: Expression Tree Creation using Prefix, Postfix and Infix Expression

Chapter 15: Graph Data Structure

Lecture 1: Graph's basic Terminology and Representation using Array and Linked List