DSA PATH

DATE 6.30-8
15 Jan what are flowcharts, pseudocodes, decision making using
flowcharts, examples
16 Jan Practice Flowchart
17 Jan basic to advanced patterns solved (butterfly, floyd's triangle,
rhombus etc.)
18 Jan Practice pattern
19 Jan Introduction to arrays, arrays in memory, Passing arrays to
functions, interview problems
20 Jan Practice array
21 Jan Practice array
22 Jan Linear search, Binary search
23 Jan Practice Linear search and binary search
24 Jan Selection sort, Bubble sort
25 Jan Practice Selection sort, Bubble sort
26 Jan Insertion sort, count sort
27 Jan Practice Insertion sort, count sort
28 Jan 2D arrays, 2D arrays in memory, Examples using 2D Arrays
29 Jan Practice 2D array
30 Jan Introduction to strings & StringBuilder, storage of strings and their
inbuilt functions

31 Jan Practice string

1 Feb Introduction to recursion, Principle of mathematical induction,
factorial, Fibonacci numbers, Recursion using arrays, Recursion using
strings, Recursion using 2D arrays, backtrack, merge sort, quick sort
2 Feb Introduction to recursion, Principle of mathematical induction,
factorial, Fibonacci numbers, Recursion using arrays, Recursion using
strings, Recursion using 2D arrays, backtrack, merge sort, quick sort
3 Feb Practice Recursion
4 Feb Practice Recursion
5 Feb Practice Recursion
6 Feb Practice Recursion
7 Feb Practice Recursion
8 Feb Practice Recursion
9 Feb Practice Recursion
10 Feb Binary number system, bitwise operators, operations on bits, fast
exponentiation
11 Feb Practice
12 Feb Order complexity analysis, Theoretical complexity analysis, Time
complexity analysis of searching and recursive algorithms, Space
complexity analysis of merge sort
13 Feb Practice complexities
14 Feb Introduction to greedy approach to problem solving, solving classical
 problems
15 Feb Objects & Classes, Creating objects, Getters, and setters,
16 Feb Practice above
17 Feb Constructors and related concepts, Inbuilt constructor and
destructor, Example classes,
18 Feb Practice above
19 Feb Static members, Function overloading and related concepts,
Abstraction, Encapsulation
20 Feb Practice above
21 Feb Inheritance,
22 Feb Practice above
23 Feb Polymorphism,
24 Feb Practice above
25 Feb Practice above
26 Feb STL Framework
27 Feb Linked list Introduction, Inserting node in linked list, Deleting node
from linked list, Midpoint of linked list
28 Feb Practice above
29 Feb Practice Above
1 March Merge two sorted linked lists, merge sort of a linked list, Reversing a
linked list
2 March Practice Above
3 March Practice above
4 March Stacks Introduction, Stack using arrays, Dynamic Stack class, Stack
using linked list, Inbuilt stack, Queue using arrays, Dynamic queue
class, circular queue
5 March Stacks Introduction, Stack using arrays, Dynamic Stack class, Stack
using linked list, Inbuilt stack, Queue using arrays, Dynamic queue
class, circular queue
6 March Practice Stack and Queue’s
7 March Practice Stack and Queue’s
8 March Practice Stack and Queue’s
9 March Practice Stack and Queue’s
10 March Practice Stack and Queue’s
11 March Practice Stack and Queue’s
12 March Practice Stack and Queue’s
13 March Introduction to Binary Trees, Constructing the tree, Binary Tree
traversals, Diameter of binary tree, height & LCA of the tree,
Introduction to Binary Search Trees, Searching a node in BST, BST
class, Inserting and Deleting nodes in BST, Types of balanced BSTs
14 March Introduction to Binary Trees, Constructing the tree, Binary Tree
traversals, Diameter of binary tree, height & LCA of the tree,
Introduction to Binary Search Trees, Searching a node in BST, BST
class, Inserting and Deleting nodes in BST, Types of balanced BSTs
15 March Practice above
16 March Practice above
17 March Practice above
18 March Practice above
19 March Practice above
20 March Practice above
21 March Practice above
22 March Introduction to Heaps, Min/Max heaps, Heap Sort, Priority Queues,
how to implement priority queues, Introduction to CBT(Complete
Binary Trees) and its implementation, Insert and Delete operations
in heaps, Implementing priority queues, In-built Priority Queue
23 March Introduction to Heaps, Min/Max heaps, Heap Sort, Priority Queues,
how to implement priority queues, Introduction to CBT(Complete
Binary Trees) and its implementation, Insert and Delete operations
in heaps, Implementing priority queues, In-built Priority Queue
24 March Practice above
25 March Practice above
26 March Practice above
27 March Practice above
28 March Practice above
29 March Practice above
30 March Practice above
31 March Introduction to Hashing, Hashmaps, Inbuilt Hashmap, Hashsets, In-
built Hashsets, Hash functions, Insert and Delete operation
implementation in hashmap/hashset, examples
1 April Introduction to Hashing, Hashmaps, Inbuilt Hashmap, Hashsets, In-
built Hashsets, Hash functions, Insert and Delete operation
implementation in hashmap/hashset, examples
2 April Practice above
3 April Practice above
4 April Practice above
5 April Practice above
6 April Practice above
7 April Practice above
8 April What are Tries, Creating a Trie node class, Insert, Search and
Remove operation in Tries, Types of Tries, Questions on Tries
9 April What are Tries, Creating a Trie node class, Insert, Search and
Remove operation in Tries, Types of Tries, Questions on Tries
10 April Practice above
11 April Practice above
12 April Practice above
13 April Practice above
14 April Introduction to Graphs, Graph Terminology, Graph implementation,
Graph Traversals (DFS and BFS), Weighted and Directed Graphs,
Minimum Spanning Trees, Cycle Detection in Graphs, Kruskal's
algorithm, Prim's Algorithm, Dijkstra's algorithm, Bellman Ford
Algorithm & a lot of questions
15 April Introduction to Graphs, Graph Terminology, Graph implementation,
Graph Traversals (DFS and BFS), Weighted and Directed Graphs,
Minimum Spanning Trees, Cycle Detection in Graphs, Kruskal's
algorithm, Prim's Algorithm, Dijkstra's algorithm, Bellman Ford
 Algorithm & a lot of questions
16 April Introduction to Graphs, Graph Terminology, Graph implementation,
Graph Traversals (DFS and BFS), Weighted and Directed Graphs,
Minimum Spanning Trees, Cycle Detection in Graphs, Kruskal's
algorithm, Prim's Algorithm, Dijkstra's algorithm, Bellman Ford
Algorithm & a lot of questions
17 April Practice above
18 April Practice above
19 April Practice above
20 April Practice above
21 April Practice above
22 April Practice above
23 April Practice above
24 April Practice above
25 April Practice above
26 April Practice above
27 April Fundamentals of Dynamic Programming, Introduction to
Memoization, Knapsack using DP, Factorial using DP, Fibonacci
numbers using recursion, memoization and tabulation, Longest
Common Subsequence (LCS) using recursion, Catalan's number, Edit
distance using recursion, memoization and dynamic programming,
Matrix Chain Multiplication and much more
28 April Fundamentals of Dynamic Programming, Introduction to
Memoization, Knapsack using DP, Factorial using DP, Fibonacci
numbers using recursion, memoization and tabulation, Longest
Common Subsequence (LCS) using recursion, Catalan's number, Edit
distance using recursion, memoization and dynamic programming,
Matrix Chain Multiplication and much more
29 April Fundamentals of Dynamic Programming, Introduction to
Memoization, Knapsack using DP, Factorial using DP, Fibonacci
numbers using recursion, memoization and tabulation, Longest
Common Subsequence (LCS) using recursion, Catalan's number, Edit
distance using recursion, memoization and dynamic programming,
Matrix Chain Multiplication and much more
30 April Fundamentals of Dynamic Programming, Introduction to
Memoization, Knapsack using DP, Factorial using DP, Fibonacci
numbers using recursion, memoization and tabulation, Longest
Common Subsequence (LCS) using recursion, Catalan's number, Edit
distance using recursion, memoization and dynamic programming,
Matrix Chain Multiplication and much more
1 May Practice above

2 May Practice above

3 May Practice above

4 May Practice above

5 May Practice above

6 May Practice above
7 May Practice above
8 May Practice above