Complete C++ Programming with Data Structures and Algorithms

Course Curriculum

Chapter 1: Introduction Section

Lecture 1: Topics for the Course

Lecture 2: Source Codes (Codes are also provided in each Section based on the Topics)

Lecture 3: Installing Dev C++ (For mac users check the resources)

Lecture 4: Basics Of Programming

Lecture 5: DataTypes

Lecture 6: TakingInput

Lecture 7: Finding_SimpleInterest

Lecture 8: ArithmeticOperators

Lecture 9: Fahrenheit to Celsius Conversion Program

Lecture 10: RelationalOperators

Lecture 11: Logical Operators

Lecture 12: Codes of part 1

Chapter 2: Conditional Statements

Lecture 1: Conditional Statements

Lecture 2: Finding The Greatest Number Code

Lecture 3: Grading a Student Code

Chapter 3: While Loop

Lecture 1: While Loop

Lecture 2: Syntax of While Loop

Lecture 3: Finding sum of N numbers

Lecture 4: sum of Even Numbers

Lecture 5: Prime Number Code and Pattern Printing Introduction

Lecture 6: Codes of part 2 and part 3

Chapter 4: Patterns

Lecture 1: Pattern 1

Lecture 2: Pattern 2

Lecture 3: Triangle Pattern

Lecture 4: Increment and Decrement Operators

Chapter 5: For loop

Lecture 1: For loop Introduction

Lecture 2: Scope of Variables

Lecture 3: Understanding Break and Continue

Lecture 4: Factorial of a given Number

Lecture 5: Reversing a given Number

Lecture 6: Palindrome Number

Lecture 7: Fibonacci Nth Number

Lecture 8: Codes of part 4 and 5

Chapter 6: Functions

Lecture 1: Functions Introduction and Calculating nCr

Lecture 2: From N given numbers Find Prime Numbers

Lecture 3: How Function Call Works

Lecture 4: Scope in Functions

Lecture 5: Pass By Value In Functions

Lecture 6: Codes of part 6

Chapter 7: Arrays

Lecture 1: Arrays Introduction

Lecture 2: Finding Max and Min in an Array

Lecture 3: Arrays and Functions 1

Lecture 4: Arrays and Functions 2

Lecture 5: Reversing an Array

Lecture 6: Linear Search

Lecture 7: Finding Duplicates in Array

Chapter 8: Sorting and Seaching Algorithms

Lecture 1: Binary Search

Lecture 2: Selection Sort

Lecture 3: Bubble Sort Algorithm

Lecture 4: Insertion Sort

Lecture 5: code of part 7 and 8

Chapter 9: Strings(Character Arrays)

Lecture 1: Length of String

Lecture 2: Reversing a String

Lecture 3: Dry Run for Reversing a String Program

Lecture 4: Replace Characters

Lecture 5: Inbuilt Functions and finding Prefixes of Strings

Chapter 10: Two Dimensional Arrays

Lecture 1: Two Dimensional Arrays

Lecture 2: Sum and Maximum In Two Dimensional Array

Lecture 3: Sum Of columns

Lecture 4: How are 2D arrays Stored

Lecture 5: Codes of part 9 and 10

Chapter 11: Pointers Understanding

Lecture 1: Pointers Introduction

Lecture 2: Pointers and Arrays 1

Lecture 3: Pointers and Arrays 2

Lecture 4: Character Array Pointers

Lecture 5: Pointers with Functions

Lecture 6: Double Pointers

Chapter 12: Dynamic Memory Allocation

Lecture 1: Pass By Reference

Lecture 2: Dynamic Memory Allocation

Lecture 3: Memory Leakage Handling

Lecture 4: Two Dimensional Arrays Dynamically

Lecture 5: Constant Variables

Lecture 6: Codes of part 11 and 12

Chapter 13: Recursion 1

Lecture 1: Factorial Using Recursion

Lecture 2: PMI in recursion

Lecture 3: Print Numbers in Increasing and Decreasing Order

Lecture 4: Power of a Number

Lecture 5: Fibonacci Using Recursion

Lecture 6: Fibonacci Output Explaination in Recursion

Lecture 7: Sorted Array

Lecture 8: Sorted Array 2

Lecture 9: Sum of array

Lecture 10: Finding Number

Lecture 11: First Index of Duplicate Numbers

Lecture 12: Last Index of Duplicate Numbers

Chapter 14: Recursion 2

Lecture 1: Length of String using Recursion