Become a Software Development Engineer

Course Curriculum

Chapter 1: Fundamentals of Computer Science

Lecture 1: Fundamentals of Computer Science

Chapter 2: Programming with C++

Lecture 1: Introduction to C++

Lecture 2: C++ Operators

Lecture 3: C++ Conditionals

Lecture 4: C++ Loops

Lecture 5: C++ Jump Statement

Lecture 6: C++ Comments and Functions

Lecture 7: C++ Call by value & Reference

Lecture 8: C++ Recursion

Lecture 9: C++ Storage Classes

Lecture 10: C++ Arrays

Lecture 11: C++ Array to Function

Lecture 12: C++ Multidimensional Arrays

Lecture 13: C++ Pointers

Lecture 14: C++ References

Lecture 15: C++ Memory Management

Lecture 16: C++ OOPs

Lecture 17: C++ Constructor and Destructor

Lecture 18: C++ This Pointer, static, Structs & Enumeration

Lecture 19: C++ Friend Function

Lecture 20: C++ Math Functions

Lecture 21: C++ Inheritance, Aggregation & Polymorphism

Lecture 22: C++ Overloading and Overriding

Lecture 23: C++ Virtual Function

Lecture 24: C++ Abstraction

Lecture 25: C++ Interfaces

Lecture 26: C++ Namespaces

Lecture 27: C++ Strings

Lecture 28: C++ Exception Handling

Lecture 29: C++ try/catch

Lecture 30: C++ User-Defined Functions

Lecture 31: C++ Templates

Lecture 32: C++ Signal Handling

Lecture 33: C++ File & Stream

Lecture 34: C++ getline()

Chapter 3: Data Structures

Lecture 1: Introduction to Arrays & Types of Array

Lecture 2: Various Operations on Arrays

Lecture 3: Largest Element in an Array

Lecture 4: Check if an Array is Sorted

Lecture 5: Second Largest Element in Array

Lecture 6: Reverse an Array

Lecture 7: Remove duplicates from a sorted array

Lecture 8: Left Rotate an Array by One & Left Rotate an Array by D places

Lecture 9: Move Zeros to End

Lecture 10: Introduction to Strings

Lecture 11: Reverse, Pangram, Case conversion

Lecture 12: Validation, Length

Lecture 13: Palindrome Check

Lecture 14: Overview of Pattern Searching

Lecture 15: Pattern Matching Algorithms:

Lecture 16: Rabin Karp Algorithm

Lecture 17: KMP Algorithm

Lecture 18: Rotations Check of two Strings

Lecture 19: Anagram

Lecture 20: Introduction to Linked List and Implementation

Lecture 21: Traversal, Insertion and Deletion

Lecture 22: Sorted Insertion in Linked List

Lecture 23: Reversal of Linked List (Iterative and Recursive)

Lecture 24: Stack Data Structure

Lecture 25: Array Implementation of Stack in C++

Lecture 26: Linked List Implementation of Stack in C++

Lecture 27: Stack Applications

Lecture 28: Queue Data Structure

Lecture 29: Application of Queue

Lecture 30: Implementation of Queue using Array

Lecture 31: Implementation of Queue using Linked List

Lecture 32: Tree Data Structure & Application of Tree

Lecture 33: Binary Tree & Tree Traversal

Lecture 34: Implementation of Inorder Traversal

Lecture 35: Implementation of Preorder Traversal

Lecture 36: Implementation of Postorder Traversal

Lecture 37: Height of Binary Tree, Print Nodes at K distance

Lecture 38: Iterative Inorder Traversal

Lecture 39: Iterative Preorder Traversal

Lecture 40: Binary Search Tree & Search in BST (Introduction)

Lecture 41: Insert, Deletion, Floor & Ceil in BST

Lecture 42: Self Balancing BST

Lecture 43: Direct Address Table, Hashing Functions & Collision Handling

Lecture 44: Chaining & Implementation of Chaining

Lecture 45: Open Addressing, Double Hashing

Lecture 46: Subarray with zero sum & given sum

Lecture 47: Longest subarray

Lecture 48: Count Distinct Elements & Frequencies of array elements

Lecture 49: Binary Heap Introduction & Implementation

Lecture 50: Binary Heap (Heapify and Extract)

Lecture 51: Binary Heap (Decrease Key, Delete and Build Heap)

Chapter 4: Algorithms

Lecture 1: Getting Started with Algorithms

Lecture 2: Linear & Binary Search

Lecture 3: Bubble Sort

Lecture 4: Selection Sort

Lecture 5: Insertion Sort

Lecture 6: Quick Sort

Lecture 7: Merge Sort

Lecture 8: What are Greedy Algorithms

Lecture 9: Fractional Knapsack