Data Structures and Algorithms
We will take you through DSA starting from the basics to advance lectures through Physical mode and
then work on Projects
Basics of Programming Installation of IDE and Learning Syntax
Flowchart & Psuedocode
Getting a hold of C++ Conditional Statements | Loops(for, while, do-while etc.)
Patterns and Problem solving | Functions
Starting with Data Structures Arrays, Pointers, Strings, Character Array | 2-D Arrays
Recursion and Backtracking Learning Recursion and Backtracking Techniques to solve problems.
Understanding the Recursive Stack working
Object Oriented Understanding OOPs principles | Learning Classes and Objects
Programming Default Functions Constructor, Copy Constructor, Copy Assignment Operator and Destructor
Divide and Conquer, Learning DNCalgorithms like Binary Search, QuickSort, Merge Sortetc Applications of Bitmasking
Bitmasking for faster execution of the Algorithms
Time and Space Complexity Learning Spaceand Time complexity Analysis Understanding Optimized Algorithms using Sieve etc.
Analysis Comparison of different algorithms to find the optimized algorithm
Stack Stack, Implementation, STL and Problem Solving of these Data Structures
Queue Queues, Practical Applications of Queue Data Structures
Implementation, STL and Problem Solving of these Data Structures
Linked List LinkedList, Practical Applications of Basic Data Structures
Implementation, STL and Problem Solving of these Data Structures
Binary Trees Binary Trees and Binary Search Trees, BFS and DFS Algorithms on Trees
Tree Traversal Algorithms like Level Order, IN/PRE/POST order etc. Classical Problems on Trees
Binary Search Trees
Heaps Implementation of Heap/Priority Queue, Interview Questions Problems Solving
Hashmap Implementation of Unordered-Maps, Collision Handling Techniques in Hashmaps Optimization of
Algorithms using Hashmaps
Greedy Algorithms Understanding the Applications of Greedy Approach
Differentiate between Recursive and Greedy Technique Applications
Dynamic Programming Learning 1 Dimensional, 2 Dimensional DP Understanding Recursive vs DP vs Greedy Techniques
Top-Down and Bottom-UP Approaches in DP
Optimization of Time Complexity using Dynamic Programming
Graphs Adjacency Matrix, Adjacency List, and Edge List DFS and BFS Algorithms on Graphs, Classic
Problems like Snake and Ladder, Components Count etc. Dijkstra's, Topological Sort Algorithm on
Directed and Undirected Graphs
Tries Implementation of Tries, Interview Questions Problems Solving