C++ with DSA Course
This Self-Paced learning course on C++ with DSA will
help all stream students to learn C++ programming
right from the basics and help them crack
programming rounds for all major companies.
C++ has a huge community that provides and fulfills
the requirements of the developers.
C++ Programming
C++ Introduction C++ Structures
C++ Variables and Literals C++ Structure
C++ Data Types Structure and Function
C++ Basic I/O C++ Pointers to Structure
C++ Type Conversion C++ Enumeration
C++ Operators
C++ Comments C++ Object & Class
C++ Objects and Class
C++ Flow Control C++ Constructors
C++ if...else C++ Objects & Function
C++ for Loop C++ Operator Overloading
C++ do...while Loop
C++ break & continue C++ Pointers
C++ switch Statement
C++ Pointer
C++ goto Statement
C++ Pointers and Arrays
C++ Pointers and Functions
C++ Functions C++ Memory Management
C++ Functions
C++ Function Types C++ Inheritance
C++ Function Overloading C++ Inheritance
C++ Default Argument Inheritance Access Control
C++ Storage Class C++ Function Overriding
C++ Recursion Multiple & Multilevel Inheritance
C++ Return Reference C++ Friend Function
C++ Virtual Function
C++ Arrays & String C++ Templates
C++ Arrays
Multidimensional Arrays C++ OOP
C++ Function and Array Encapsulation
C++ String Polymorphism
Abstraction
DSA using C++
DSA Introduction Tree based DSA (Part I)
• What is an algorithm? • Tree Data Structure
• Why to learn algorithms? • Tree Traversal
• Asymptotic Notations • Binary Tree
• Master Theorem • Full Binary Tree
• Divide and Conquer Algorithm • Perfect Binary Tree
• Complete Binary Tree
Data Structures (Part I) • Balanced Binary Tree
• Binary Search Tree
• Array
• Stack • AVL Tree
• Queue
• Types of Queue Tree based DSA (Part II)
• Circular Queue • B Tree
• Priority Queue • Insertion into B-tree
• Deque • Deletion from B-tree
• B+ Tree
• Insertion on a B+ Tree
Data Structures (Part II)
• Deletion from a B+ Tree
• Linked List
• Red Black Tree
• Linked List Operations
• Linked List Traversals • Insertion in Red Black Tree
• Types of Linked List • Deletion from Red Black Tree
• Hash Table
• Heap Data Structure Recursion
• Fibonacci Heap •• Introduction to Recursion
• Decrease Key and Delete node • Natural Number Check using
from Fibonacci Heap Recursion
• Palindrome Check using
Recursion
• Tower of Hanoi
DSA using C++
Introduction to Hashing Greedy Algorithms
• Address Table • Ford-Fulkerson Algorithm
• Collision Handling • Dijkstra's Algorithm
• Open Addressing • Kruskal's Algorithm
• Double Hashing • Prim's Algorithm
• Chaining v/s Open Addressing • Huffman Code
Sorting and Searching Dynamic Programming
Algorithms * Flyod-Warshall Algorithm
* Longest Common Subsequence
• Bubble Sort
Algorithm
• Selection Sort
* Backtracking Algorithm
• Insertion Sort
* Sliding Window Algorithm
• Merge Sort
* Loop Detection Algorithm
• Quick Sort
* Rabin Karp Algorithm
• Counting Sort
* Kadane’s Algorithm
• Radix Sort
* KMP Algorithm
• Bucket Sort
* Kosaraju Algorithm
• Heap Sort
• Shell Sort
• Linear Search
• Binary Search
