Week 01

Module 01 C++ Basic

- Introduction 
- Basic IO 
- Data Types 
- Namespace 
- if-else
- loop 

Module 02

- Array
- String 
- Function 
- Pointer 
- Dynamic Allocation 
- Vector 
- Swap min max 

Contest

-

Lab Class

-
- Access Modifiers 
- Constructor and Destructor 
- Dynamic Object in C++
- Array of Class 
- Sort Array of Class 

Week 02 (Time Complexity and Array)

Module - 01 (Time Complicity and Linear Search)

- Factors of Judging Algorithm 
- Time Complexity 
- Linear Search

Practice day

Array Operation

- Binary Search 
- Binary Search Complexity 
- Dynamic Array insertion 
- Dynamic Array Deletion 

Practice Day 2

Lab Class About Bubble Sort, Insertion and Sieve Complexity

- Introduction to Sorting 
- Bubble Sort 
- Insertion Sort 
- Sieve Complexty 

Assignment.

Week 3 Sorting and Introduction to Linked List

Merge Sort

- Why Merge Sort 
- Merge Sort 
- Quick Sort 

Practice Day

Quick Sort and Introduction to Linked List

- Quck Sort 
- Intro Linked List 

Lab Class About Linked List

= Linked List Implementation 
- Linked List Inser at head 
- Linked list Traverse 
- Linke List Searching 

Assingment Lab

Week 04 Deep Dive Into Liked List

Likned List Operations

- LInked List Recap 
- Linked List Lenght 
- Linked List Insert At Any index. 
- Linked List Delete at head.
- Linked List Delete any index .

More About Linked List

- Linked List Insert After a value. 
- Reverse print of a linked list 
- Intro to dubly linked list 
- Dubly linked list insertion 
- Doubly Linked List Deletion 

Doubly Linked Operation

- Structure 
- Insertion At Head 
- Insertion At any index
- List Deletion 
-Reverse

Theory Mid Term Exam

Week 05 Recap Week

Complexity Recap

- Time and Space Complexity 

Recursion and Merge Sort

- Recursion 
- Factorial and Coin Change 
- Merge Sort 

Lab Class About singly and Doubly Linked Insertion and Deletion

Week 06 Stack and Template in C++

Stack

- Stack Theory
- Stack Using Array Thery 
- Stack Implementation using Dynamic Array
- Stack using Linked List Theory 
- Stack Implementation using Linked List 

Template in C++

- Template in C++
- Template Based Stack Part 1 
- Template Based Stack Part 2
- Reverse a stack using another stack 
- Sorting a Stack 

Lab About Stack and List Operation

- list<int> l 
- push_front (Insert at A Head)
- Iterator or auto 
- begin() and end()
- push_back() and push front()
- pop_back() and pop_front()

// Insert Any Positon 
auto it = l.begin();
advance(it, 1);
l.insert(it, 100);
print(l);

// Stack Built in Function 
Pop, push and top 

// Regular Braket sequence check 
() {} []

// infix to postfix 
infix = a+b*c+d
postfix = abc*+d+

Week 07 Introduction to Queue

## Queue 
    - Introduction to Ques 
    - Queue Using Array Theroy 
    - Queue using Array Implementation 
    - Queue using Circular Array Theory 
    - Queue Using Circular Array Implemention 
    
## More About Queue
    - Queue Using Linked List Theory 
    - Queue using linked List theory 
    - Queue sing linked list implementation 
    - STL Queue 
    - Binary Conversiont using queue theory 
    - Binary conversion using queue implementation 

## Lab Class About Deque
    - Deque using Doubly Linked List 
    - Reverse a deque 
    

## Lab Assignment 

Week 08 Binary Tree

## Week 08 Binary Tree

Non Linear DS and Tree

- Introduction to Non-Linear DS and Tree
- Introduction to Graph and Tree
- Variations of Binary Tree
- Binary Tree Structure Theory 
- Binary Tree Implementaion 

BFS and DFS

- BFS Traversal Theory 
- BFS Traversal Implementation 
- DFS Traversa 
- Inorder, Preorder and Postorder Traversal 
- Insertion 
- Searching 

BST

- Introduction of BST
- BST Insertion 
- BST Searching 
- BST Deletaion 

Week 09 Heap and STL

Introduction to Heap

- Heap Insertion Theory 
- Heap Insertion Implementation 
- Heap Delete Theory and Implementation 
- Heap Max Operation Implementation 

Heap and STL

- Buil Heap From Array  
- Build Heap complexity 
- Heap Sort 
- Prioriryt Queue 
- STL Priority Queue 
- Priority Queue Example Problem 

STL C++

- Vector
- List
- Stack 
- Quue
- Deque
- Set
- Multiset 
- STL Pair 
- STL Map 

Final Lab Final Assignment =====================================Ending Course ================================