Data Structures and Algorithms : DSA using C++

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction to the course

Lecture 2: Introduction to Data Structures

Lecture 3: Data structure and memory Usage

Lecture 4: Types of Data Structures

Lecture 5: Linear List and Abstract Data Type

Chapter 2: Recursion

Lecture 1: Idea behind Recursion

Lecture 2: Understanding what Recursion is

Lecture 3: Sum of 2 numbers

Lecture 4: Let's Code Sum of 2 Numbers using Recursion

Lecture 5: Product of 2 Numbers

Lecture 6: Let's Code Product of 2 Numbers Using recursion

Lecture 7: Power Function a^b

Lecture 8: Let's Code Power Function a^b

Lecture 9: Fibonacci Series

Lecture 10: Let's Code Fibonacci Series using Recursion

Lecture 11: Finding GCD or HCF of 2 given numbers Using Recursion

Lecture 12: Let's Code GCD or HCF Using Recursion

Lecture 13: Finding Factorial of a given number Using Recrsion

Lecture 14: Let's Code Factorial Using Recursion

Chapter 3: Computational Complexity

Lecture 1: Introduction to Time and Space Complexity

Lecture 2: Asymptotic Notations

Chapter 4: Array – A Linear Data Structure

Lecture 1: Why Arrays ? and What is Arrays ?

Lecture 2: Declaring, Initializing and Accessing – Arrays

Lecture 3: Static Vs Dynamic Arrays – Memory Layout of Main Memory

Lecture 4: Static Vs Dynamic Arrays Details

Lecture 5: Static Vs Dynamic Arrays Details Continue…

Lecture 6: Introduction to 2 Dimension Arrays

Lecture 7: Using Different methods to allocate the Memory for 2 Dimension Arrays

Lecture 8: Allocating and DeAllocating Memory for 2-Dim Arrays

Lecture 9: Representation of Arrays

Lecture 10: Representation of 2-Dim Arrays

Lecture 11: Row-Major and Column-Major Order for 2-Dim Arrays

Lecture 12: Row-Major and Column-Major Order for 3-Dim Arrays

Lecture 13: Representation of n-Dim Arrays

Chapter 5: Array ADT(Abstract Data Type)

Lecture 1: Introduction to Array ADT

Lecture 2: Array Class ADT

Lecture 3: Let's Code the Array ADT class

Lecture 4: Let's Create an Array ADT

Lecture 5: Creating an Exceptional Class and Array

Lecture 6: Inserting the Element in an Array

Lecture 7: Let's write the Code for Inserting the Element in an Array

Lecture 8: Deleting the Element from an Array

Lecture 9: Let's write the Code for Deleting the Element from an Array

Lecture 10: Find() and search() operations on Array

Lecture 11: Let's write the Code for Find() operation on Array

Lecture 12: Let's Code Search() operation on Array

Lecture 13: Let's Code IsEmpty() IsFull() operations on Array

Lecture 14: Let's see Length() and Display() operations

Lecture 15: More Operations – Get(), Set(), FindMAX(), FindMIN(), Sum(), Avg() and Append()

Lecture 16: Let's Implement Get(), Set() and indexOf() operations on Array

Lecture 17: Let's Code FindMAX(), FindMIN(), Sum(), Avg() and Append() operations on Arrays

Lecture 18: Shifting the data Elements of an Array

Lecture 19: Let's Rotate the Elements of Array

Lecture 20: Let's Code Left and Right Rotate of the Elements on Array

Lecture 21: Let's Reverse the Data Elements of Array

Lecture 22: Let's Code Reversing the Data Elements of Array

Lecture 23: Let's Search in Array using LINEAR Search technique

Lecture 24: Let's Code Linear Search Technique

Lecture 25: Let's understand BINARY Search on Array

Lecture 26: Understanding the ITERATIVE BINARY SEARCH

Lecture 27: Let's Code Binary Search (Iterative Method)

Lecture 28: Recursive Binary Search on Arrays

Lecture 29: Let's Code Recursive Binary Search technique

Lecture 30: Binary Search Using Divide and Conquer Apprach

Lecture 31: Let's Code Binary Search Using Divide and Conquer Apprach

Lecture 32: Coding Challenge: Finding Maximum and Minimum from an Array

Lecture 33: Solution to Coding Challenge : Finding Maximum and Minimum

Lecture 34: Coding Challenge : Finding Minimum Number of Merge operations on Arrays

Lecture 35: Solution to Coding Challenge Finding Minimum No. of Merge operations on Arrays

Lecture 36: Coding Challenge : Print All Sub-Arrays with zero sum

Lecture 37: Solution to Coding Challenge printing All Sub-Array with zero-sum

Lecture 38: Coding Challenege : Find Smallest missing positive number from an unsorted array

Lecture 39: Solution to Coding Challenge Finding Smallest Positive number

Chapter 6: Linked List – A Dynamic Data Structure

Lecture 1: Introduction to Linked Lists

Lecture 2: Linked List Vs Arrays

Lecture 3: Linked Lists in CPP

Lecture 4: Types of Linked Lists

Lecture 5: Singly Linked List and its Operations

Lecture 6: Singly Linked List Class ADT

Lecture 7: Let's Code Class ADT for Singly Linked Lists

Lecture 8: Example working with Insert Process in a Linked Lists

Lecture 9: Understanding the Code for Inserting an Element in a Linked List

Lecture 10: Program for Inserting an Element in a Linked List

Lecture 11: Deleting an Element from Singly Linked List

Lecture 12: Program for Delete from Singly Linked Lists

Lecture 13: Applying Find() operation on Singly Linked List

Lecture 14: Program to Implement FIND() operation on Singly Linked Lists

Lecture 15: Applying Search() operation on Singly Linked List

Lecture 16: Program to Implement Search() operation on Singly Linked Lists

Lecture 17: isEmpty() and isFull() in Singly Linked List