Introduction:

   Learn from the basics, such as Analysis of Algorithms, Order of Growth

Mathematics:

   Learn Finding the number of digits in a number, Arithmetic and Geometric Progressions, Quadratic Equations, Mean and Median.

Bit Magic:

   Bitwise Operators in C++ and Java and many practices problems

Recursion:

   Introduction to Recursion, Applications of Recursion, Writing base cases in Recursion

Arrays:

   Introduction and Advantages, Types of Arrays, Operations on Arrays

Searching:

   Binary Search Iterative and Recursive, Binary Search and various associated problems

Sorting:

   Implementation of C++ STL sort () function in Arrays and Vectors, Sorting in Java, Arrays.sort() in Java, Collection.sort() in Java

Matrix:

   Introduction to Matrix in C++ and Java, Multidimensional Matrix, Pass Matrix as Argument, Printing matrix in a snake pattern

Hashing:

   Introduction and Time complexity analysis, Application of Hashing, Discussion on Direct Address Table

Strings:

   Discussion of String DS, Strings in CPP, Strings in Java, Problems

Linked List:

   Introduction, Doubly Linked List, Circular Linked List, Loop Problems

Stack:

   Understanding the Stack data structure, Applications of Stack, Implementation of Stack in Array and Linked List

Queue:

   Introduction and Application, Implementation of the queue using array and LinkedList

Deque:

   Introduction and Application, Implementation in C++ STL and Java and Problems

Tree:

   Introduction, Implementation in various Transversals

Binary Search Tree:

   Background, Introduction and Application, Implementation of Search in BST, Insertion in BST

Heap:

   Introduction & Implementation, Binary Heap, Heap Sort

Graph:

   Introduction to Graph, Graph Representation, Breadth-First Search

Greedy:

   Introduction, Activity Selection Problem, Fractional Knapsack

Backtracking:

   Concepts of Backtracking, Rat in a Maze, N Queen Problem, Sudoku Problem

Dynamic Programming:

   Introduction, Dynamic Programming, Problems

Trie:

   Introduction, Count Distinct Rows in a Binary Matrix

Segment Tree:

   Introduction, Construction, Range Query, Update Query

Disjoint Set:

   Introduction, Find and Union Operations, Union by Rank, Path Compression

Training Programs Organized