Week-wise Modules

• The course is divided into 16 modules which will be covered in approximately 6 months
• Learning the use of C++ : (16 hours approx. 4 weeks), Introduction to C++ as a programming language,Installation of VS Code and making it ready to get started,Number Systems,Basic Printing,Variables and Data types,Arithmetic Operations,Importance of inclusion of header file,Compilation Process,Taking input from the user,Other operators,Operator Precedence,Data Type Casting,If, Else if and else,Combining multiple conditions,Ternary and switch statement,Problems on conditions,For, while and do-while loops,Problems on loops,Break and continue,Problems on loops using operators,Pattern Printing Basic Problems,Pattern Printing Advanced Problems,Need and importance of functions,Function declaration and definition,Global and local variable,What is int. main(),Various inbuilt functions,Incorrect swap function,What is a variable in terms of memory?,Address of a variable,Introduction to Pointers,Pointer Arithmetic,Pass by reference and pass by value,Functions and pointers (Correct swap function),Double pointers,Array declaration,Array elements accessing and modification,Linear Search,Arrays as argument to functions,Arrays and pointers,Problems on Arrays,Dynamic Allocation,Implementation of Dynamic Array class,Introduction to C++ STL and Vectors,Problems on one dimensional arrays,Two dimensional Array declaration,2D array elements accessing and modification,Problems on 2D arrays,Problems on 2D arrays,Matrix Multiplication,Problems on 2D arrays,Character Arrays,C++ STL string class,Problems on Strings.
• Analyzing the basics of algorithms : (8 hours approx. 2 weeks),Why asymptotic analysis,Time Complexity,Space Complexity,Problems to calculate time complexity,Bubble Sort,Time and space complexity,Selection Sort,Insertion Sort,Problems on Basic Sorting.
• “Searching” for dots to connect: (5 hours approx. 1.5 weeks),Analysis of linear search,Binary Search,Implementation of C++ lower bound,Search Space of Binary Search,Problems on Binary Search.
• Let’s learn Recursion : (5 hours approx. 1.5 weeks),Recursion,Principle of Mathematical Induction,Problems on Recursion 1,Calculating time complexity of Recursive codes,Greatest Common Divisor,Problems on Recursion 2,Efficient Power function,Problems on Recursion 3,Problems on Recursion 4.
• Sort your careers with ”Advanced Sorting” : (5 hours approx. 1.5 weeks),Merge Sort,Time and space complexity analysis of divide and conquer
• Inversion Count,Problems on Merge sort,Quick Sort,Randomised ,Quick Sort,Inbuilt sort functions,Custom Comparators,Cyclic Sort,Problems on,Cyclic Sort,Sieve of Eratosthenes,Questions on Prefix Sum,Sliding Window,Basic bitwise operations: AND OR NOT XOR ,Basic problems on XOR operator,Modulo Operation,Basic Modulo Properties,Some basic problems using Modulo Arithmetic.
• Go through Object Oriented Programming : (5 hours approx. 1.5 weeks),Importance of OOPS paradigm,Class declaration and definition,Data members and methods,Creating objects,Constructors,Destructors,Friend Function,Operator Overloading,Pillars of OOPS.
• Learn unlinking the Linked List : (5 hours approx. 1.5 weeks),Implementation of Linked List class,Two pointers (or multiple pointers)approach,Problems on Linked List,Problems on Linked List,Implementation of Doubly Linked List,Other kinds of Linked List (Just introduction and uses).
• Stack up your doubts: (5 hours approx. 1.5 weeks),Inbuilt stack class,Problems on stack 1,Problems on Stack 2,Problems on Stack 3,Implementation of Stacks.
• Queue in your projects: (5 hours approx. 1.5 weeks),Inbuilt queue class,Problems on Queues 1,Problems on Queues 2.
• Let’s create Binary trees: (5 hours approx. 1.5 weeks),Linear vs Non-linear data structures,Implementation of Binary Trees,Tree traversals
• Height and diameter of binary tree,Some Mathematical observations and formulas for binary trees,Problems on Binary Trees,Introduction to Trees,Implementation of Tree class (Input and printing),Use of Binary Search Tree,Implementation of BST (including searching),Deletion of Nodes in BST,Problems on BST,Time complexity analysis and need for balanced BSTs,Implementation of AVL Trees.
• Let's get the “Priority Queues” in place: (5 hours approx. 1.5 weeks),Introduction to Complete Binary Trees,Introduction to Priority Queues,Inbuilt Priority Queue,Implementation of Heap Data Structure,Heap Sort,Problems on Priority Queue.
• Learn Hashmaps and Sets: (5 hours approx. 1.5 weeks),Need of hashmaps,Introduction to hashmaps,Use of inbuilt hashmaps,Problems on hashmaps,Problems on hashmaps,Hash functions,Collision Handling,Implementation of Hashmaps,Load Factor,Use of inbuilt sets,Problems on Sets.
• Backtracking will make you wonder: (5 hours approx. 1.5 weeks),Backtracking,Problems of Backtracking 1,Problems of Backtracking 2.
• The only greed we support “Ad-hoc and Greedy”: (5 hours approx. 1.5weeks),Various problems requiring simple observations,Problems using Greedy Approach.
• Revisit Dynamic Programming and Bit Manipulation: (5 hours approx. 1.5weeks),Dynamic Programming,Bottom Up Thinking,Top Down Approach,Problems on Dynamic Programming,Problems on Dynamic Programming,Setting and unsetting of bits,Problems on Bit Manipulation and Dynamic Programming.
• Stock up your Graphs: (7 hours approx. 2 weeks),Importance of understanding graphs,Graph Terminology,Various implementations,Breadth-First Search,Depth First Search,Weighted Graphs,Directed Graphs,Bellman Ford Algorithm,Floyd Warshall Algorithm,Dijkstra’s Algorithm,Minimum Spanning Trees,Prim’s Algorithm,Union Set implementation,Problems on Union Set,Kruskal's Algorithm,Topological Sort and implementation,Strongly Connected Components,Kosaraju’s Algorithm,Implementation of Tries,Huffman Encoding Algorithm.
• Live projects and case studies (4 hours approx. 1 week)