Introduction – History of C++, Assembler, Compiler, Linker & Loder, Execution Process.

various softwares available, Code-bloks Installation, Online Compilors.

Basic requirements to write a program –  Comments, #include Statement, Printf & Scanf, Displaying Output, reading Input from terminal.

Writing first Program, Datatypes, Data types, Primitive Data types, Variables,

Introduction to Arrays, Arrays Declarations, challenge – Adding all Elements of Array, Finding Max element from Array,

Introduction to Pointers,

Introduction to Strings, Reading and Writing String, Length , Concatenate and Copy,Substring and Compare,Tokeniser and To Integer.

Introduction to functions, Function for Adding 2 numbers,Function for Finding maximum of 3 numbers, 

introduction to OOPS, Principles of Object-Oriented Programming, Class vs Objects, Writing a Class in C++, Pointer to an Object, Philosophy Behind Data Hiding,Data Hinding in C++ (Accessors and Mutators), Accessors and Mutators.

Inheritance with example, Constructors in Inheritance, isA and hasA, Access Specifiers, Types of Inheritance, Ways of Inheritance, Generalization and Specialization.

Exception Handling, Exception Handling Construct, Throw and Catch Between Functions, All About Throw & Catch.

Converting Binary to Octal to hexadecimal.

Big O nortation, Reading declaration, controller OS, Pass by value and refference revise, requirements to write a program, Stacks, Queues, Linked List, Trees

LIFO, FIFO, user applications, array vs stacks, push & pop, applications, reverse.

LIFO, FIFO, user aplications, array vs queus, Insert, Delete, application, reverse.

Infix, Postfix, Prefix, Local variables, psudo code, palindrome, paranthesis, conversion, search operation (null, max, min) [psudo code & c code], reverse, application.

Singly, Doubly, Circular.

array vs Linked list,

node creation, Insert front & rear, Delete

Display, pvg for Insertion, Deletion, Front and rear end.

Doubly Linked List – Insertion front & rear end, delete, display

Implementation to stack, queue

Print middle node, kth node, search multiples, max.

concatenation of linked list,

reverse linked list.

Leaf node, Root node

different trees – ordinary, binary, strictly binary, complete binary, binary search tree, building binary tree.

Tree Traversals – Pre-order, In-order, Post order.

Insert node.

Recursion, Sorting, Searching, BFS+DFS,Dynamic Programming.

• Introduction to Algorithms, Recursion Introduction,  
• Stack Overflow, 
  
• Anatomy Of Recursion, Exercise: Factorial
•  
• ,

   Fibonacci, Recursive VS Iterative, Recursive VS Iterative, When To Use Recursion, Exercise: Reverse String With Recursion.

• Sorting Introduction 
• The Issue With sort()
• Sorting Algorithms 
• Bubble Sort
• Selection Sort
• Dancing Algorithms
• Insertion Sort
• Merge Sort and O(n log n)
• Stable VS Unstable Algorithms
• Quick Sort
• Which Sort Is Best?
• Heap Sort
• Radix Sort + Counting Sort

• Searching + Traversal Introduction
• Linear Search 
• Binary Search

   

• Graph + Tree Traversals

• BFS Introduction

• DFS Introduction

• BFS vs DFS 

• Resources: BFS vs DFS

• Exercise: BFS vs DFS
• Solution: BFS vs DFS 
• breadthFirstSearch()
• breadthFirstSearchRecursive()
• PreOrder, InOrder, PostOrder
• depthFirstSearch() 
• Optional Exercise: Validate A BST
• Graph Traversals
• BFS in Graphs
• DFS in Graphs
• Dijkstra + Bellman-Ford Algorithms
• Searching + Traversal Review

Hash Tables Introduction

Hash Function, Hash Collision, Hash Tables In Different Languages