Mind Coders The Future Is Here...

DSA With C&C++

Add-On
Python/MERN/Java
Full stack
Become an Expert in DSA with C C++ Add-On
Python/MERN/Java Full stack

4.5
Rating

100+ 9 Months Internship

hours Classroom Program
Certificate
Recorded Content

~Master the Core of Coding: Unlock Efficiency

Mind Coders
The Future Is Here...

Course Overview

Course Benefits

Weekly Schedule

Contact Us
 COURSE OVERVIEW
The DSA with C & C++ course offers a comprehensive understanding of Data Structures
and Algorithms (DSA), focusing on fundamental concepts like arrays, linked lists, stacks,
queues, trees, graphs, sorting, and searching algorithms using C and C++. This course is
designed to build a solid foundation in problem-solving and algorithmic thinking,
equipping students to tackle complex coding challenges efficiently. As an add-on,
learners can choose to specialize in Python Full Stack, MERN Full Stack, or Java Full
Stack to further enhance their skill set in web development, providing a seamless
pathway from mastering DSA to becoming proficient full stack developers.

DATA
Structures and
Algorithms
(DSA) with
C/C++
Mind Coders The Future Is Here...

COURSE BENEFITS

Limited Batch
1:1 Mentorship Strength

Multiple Real-Life
Projects Doubt Assistance

Course Completion
Contest Certificate

Hands-on practice
with Real-World Internship Certificate
Datasets
 Mind Coders
The Future Is Here...

DATA
Reach your audience and

STRUCTURE AND
convert your leads

ALGORITHM
 Mind Coders The Future Is Here...

ANALYSIS OF ALGORITHMS

- Analysis of Algorithms (Background)

- Asymptotic Analysis - Order of Growth - Best, Average and Worst Cases
- Asymptotic Notations
- Big O Notation
- Omega Notation
- Theta Notation
- Analysis of Common Loops
- Analysis of multiple loops
- Analysis of Recursion
- Recursion Tree method for solving recurrences
- More example recurrences
- Upper bound using Recursion tree method
- Space Complexity

MATHEMATICS

Python DSA
- Count Digits
- Palindrome Number
- Factorial of a number
- Trailing Zeros in Factorial
- GCD and HCF of two numbers
- LCM of two numbers
- Check for Prime
- Prime Factors
- All Divisors of a Number
- Sieve of Eratosthenes
- Computing Power
- Iterative Power
 Mind Coders The Future Is Here...

LIST

List (Dynamic Sized Array) Introduction

- Working of List in Python
- Average or Mean of a List
- Separate Even and Odd
- Get Smaller Elements
- Slicing (List,Tuple And String)
- Comprehensions in Python
- Largest Element in a List
- Second Largest Element in a list
- Check if a list is Sorted
- Find the only Odd
- Reverse a List in Python
- Remove duplicates from sorted array
- Move Zeros to End
- Leaders in an Array problem
- Frequencies in a sorted array
- Left Rotate a List by one

RECURSION

- Applications of Recursion
- Writing Base Cases in Recursion
- Tail Recursion
- Practice For Recursion (Part 1)
- Practice For Recursion (Part 2)
- Print N to 1 using Recursion in Python
- Print 1 to N using Recursion in Python
- Sum of Natural Numbers Using Recursion
- Sum Of Digits Using Recursion
- Palindrome Check using Recursion
 Mind Coders The Future Is Here...

SEARCHING

- Binary Search in Python

- Recursive Binary Search in Python
- Analysis of Binary Search
- Index of first occurrence in a sorted array
- Index of Last Occurrence
- Count Occurrences in a Sorted Array
- Count 1s in a Sorted Binary Array

SORTING

- Sorting in Python
- List Sort in Python
- Sorted in Python
- Stability in Sorting Algorithm
- Bubble Sort
- Selection Sort
- Insertion Sort in Python
- Merge Sort Algorithm
- Merge Two Sorted Arrays
- Merge Subarrays
- Count inversions in Array
- Merge Sort Analysis
- Quick Sort Introduction
- Partition a Given Array
- Lomuto Partition
- Hoare's Partition
- Quick Sort using Lomuto Partition
- Quick Sort using Hoare's Partition
- Analysis of Quick Sort
- Space Analysis of Quick Sort
- Heap Sort
 Mind Coders The Future Is Here...

HASHING

-Introduction to Hashing
- Hashing Application
- Direct Address Table
- Hashing Functions
- Collision Handling
- Chaining
- Implementation of Chaining in Python
- Open Addressing - Double Hashing
- Implementation of Open Addressing in Python
- Chaining vs Open Addressing
- Set in Python - Dictionary in Python
- Count Distinct Elements in a List
- Frequencies of array elements

STRING

Strings in Python
- Escape Sequences and Raw Strings
- Formatted String in Python
- String Comparison in Python
- String Operations Part (1)
- String Operations Part (2)
- Reverse A String in Python
- Check if string is rotated
- Check For Palindrome In Python
- Check if a String is Subsequence of Other
- Check for Anagram in Python
- Leftmost Repeating Character
- Leftmost Non-Repeating Element
- Reverse words in a string
 Mind Coders The Future Is Here...

LINKED LIST
- Video
- Problems with Array Data Structure
- Linked List Introduction in Python
- Simple Linked List Implementation in Python
- Applications of Linked List - Traversing a Linked List in Python
- Search in Linked List
- Insert At The Bigenning of Linked list in Python
- Insert at The End Of Linked List
- Insert at Given Position in Singly Linked list
- Delete First Node Of Linked List in Python
- Delete Last Node of Linked List
- Delete a node with pointer given to it
- Sorted Insert Linked List in Python
- Middle of Linked List
- Nth Node From end of Linked List
- Remove duplicates from a sorted Singly Linked List
- Reverse a Linked List In Python
- Recursive Reverse A Linked List (Part 1)
- Recursive Reverse A Linked List (Part 2

CIRCULAR LINKED LIST

-Circular Linked List in Python

- Circular Linked List (Advantages & Disadvantages)
- Circular Linked List traversal
- Insert at the Beginning of Circular Linked List
- Insert at The End of A Circular Linked List
- Delete Head of circular Linked List
- Delete Kth Node of Circular Linked List
 Mind Coders The Future Is Here...

DOUBLY LINKED LIST

Doubly Linked List in Python

- Singly Vs Doubly Linked List (Advantages & Disadvantages)
- Insert at the Beginning of DLL in Python
- Insert at the End of DLL in Python
- Delete Head of A Doubly Linked List
- Delete Last Node of DLL in Python
- Reverse A Doubly Linked Llist in Python

STACK

- Stack Data Structure

- Stack in Python
- Linked List Implementation of Stack in Python
- Stack Applications
- Check for Balanced Parenthesis in Python

QUEUE
- Queue in Python
- Queue Data Structure
- Application of Queue Data structure
- Implementation of Queue using Array
- Linked List Implementation of Queue in Python
DEQUE

- Deque Introduction
- Deque Applications
- Deque in Python
- List Implementation of Deque in Python
- Linked List Implementation of Deque
 Mind Coders The Future Is Here...

TREE
- Tree Data Structure
- Application of Tree
- Binary Tree in Python
- Tree Traversal
- Inorder Traversal in Python
- Preorder Traversal in Python
- Postorder Traversal in Python
- Height of Binary Tree
- Print Node at K distance
- Level Order Traversal
- Size of Binary Tree in Python
- Maximum in Binary Tree
- Iterative Inorder Traversal
- Iterative Preorder Traversal
- Iterative Preorder Traversal (Space Optimized)

BINARY SEARCH TREE

- Binary Search Tree(Background)

- Binary Search Tree(Introduction)
- Search in BST in Python
- BST insert in Python
- BST Delete in Python
- Floor in BST (Problem and Solution Idea)
- BST Floor in Python
- Ceiling in BST in Python
- Self Balancing BST
- AVL Tree
- Red Black Tree
- Applications of BST
 Mind Coders The Future Is Here...

HEAP

- Binary Heap Introduction

- Heap Python Implementation (Introduction)
- Binary Heap Insert
- Binary Heap (Extract min and Heapify)
- Decrease Key and Delete Operations
- Build Heap - Heap Sort - Heapq in Python

DATA STRUCTURE - ADVANCED

BIT MAGIC
- Bitwise Operator in Python - Part 1
- Bitwise Operator in Python - Part 2
- Check Kth bit is set or not
- Count Set Bits
- Power of Two
- One Odd Occuring
- Two Odd Occuring
- Power Set Using Bitwise

LIST

-Left Rotate by d Places

- Maximum difference
- Stock Buy &Sell Part 2
- Trapping Rainwater
- Maximum Consecutive 1s
- Longest even odd subarray
- Majority element
- Minimum Consecutive flips
- Sliding Window Technique
- Maximum subarray sum
- Maximum circular sum subarray
- Prefix Sum Technique
 Mind Coders The Future Is Here...

RECURSION
- Subset of a given string
- Printing all Permutations
- Tower of Hanoi in Python
- Josephus Problem in Python
- Subset sum problem
- Rope Cutting Problem

SEARCHING
- Search in Sorted Rotated Array
- Median of two sorted arrays
- Repeating Elements Part (1)
- Repeating Elements Part (2)
- Allocate Minimum Pages (Naive Method)
- Allocate Minimum Pages (Binary Search)

SORTING
- Tail Call Elimination in Quick Sort
- Kth Smallest - Minimum Difference in an Array
- Chocolate Distribution Problem
- Sort an array with two types of element
- Sort an array with three types of elements
- Merge overlapping intervals
- Meeting the maximum guests
- Counting Sort
- Cycle Sort
- Bucket Sort
- Radix Sort
- Overview of sorting algorithm
 Mind Coders The Future Is Here...

HASHING
- Intersection of two arrays
- Union of two unsorted arrays
- Pair with given sum in unsorted array
- Subarray with 0 sum in Python
- Check for Palindrome Permutation
- Subarray with given sum
- Longest Subarray with equal number of 0s and 1s
- Longest common span with same sum in binary array
- Longest Consecutive Subsequence
- Longest Subarray with given sum
- More than n/k Occurences (O(nk) solution)

STRING

- Overview of Pattern Searching

- Pattern Searching in Python
- Naive Pattern Searching
- Improved Naive Pattern Searching for Distinct
- Rabin Karp Algorithm
- KMP Algorithm (Part 1 : Constructing LPS Array)
- KMP Algorithm (Part 2 : Complete Algorithm)
- Anagram Search
- Lexicographic rank of a String
- Longest Substring With Distinct Characters

LINKED LIST

- Reverse a linked list in groups of size k

- Detect loop using floyd's cycle detection algorithm
- Detect and remove loop in linked list
- Intersection Point of two linked list
- Segregate even odd nodes of linked list
- Pairwise swap nodes of linked list
- Clone a linked list using a random pointer
- LRU Cache Design
- Merge two sorted linked lists
 Mind Coders The Future Is Here...

STACK
- Two stacks in an array
- K Stacks in an array
- Previous Greater Element
- Next Greater Element
- Stock span problem
- Largest Rectangular Area in a Histogram (Part 1)
- Largest Rectangular Area in a Histogram (Part 2)
- Largest Rectangle with all 1's - Stack with getMin() in O(1)
- Design a stack with getMin() in O(1) space
- Infix to Postfix (Simple Solution)
- Infix to Postfix (Efficient Solution)
- Evaluation of Postfix
- Infix to Prefix (Simple Solution)
- Infix to Prefix (Efficient Solution)
- Evaluation of Prefix

QUEUE
(Queue and Deque)
- Queue Implementation using Circular List
- Implementing stack using queue
- Reversing a Queue
- Generate numbers with given digits
- Design a data structure with min/max operations
- Maximums of all subarrays of size k
- First Circular Tour
TREE
Level Order Traversal by Line - Part 1
- Level Order Traversal by Line - Part 2
- Check for Balanced Binary Tree
- Maximum Width of Binary Tree
- Convert Binary Tree to Doubly Linked List
- Construct Binary Tree from Inorder and Preorder
- Tree Traversal in Spiral Form
 Mind Coders The Future Is Here...
BINARY SEARCH TREE
- Ceiling on the left side in an array
- Find Kth Smallest in BST
- Check for BST
- Fix BST with Two Nodes Swapped
- Pair Sum with Given BST
- Vertical Sum in a Binary Tree
- Vertical Traversal of binary tree
- Top View of Binary Tree
- bottom view of binary tree

HEAP
- Sort K Sorted Array
- Purchase Maximum Items
- K Largest Elements
- K Closest Elements
- Merge K Sorted Arrays
- Median of a Stream

GRAPH
- Introduction to Graph
- Graph Representation (Adjacency Matrix)
- Graph Representation (Adjacency List)
- Graph Adjacency List Representation in Python
- Adjacency Matrix and List Comparison
- Breadth First Search in Python
- BFS for Disconnected Graph
- Connected Components in an Undirected Graph using BFS
- Applications of BFS
- Depth First Search
- DFS For Disconnected Graph
- Connected Components in an Undirected Graph using DFS
- Applications of DFS
- Shortest Path in an Unweighted Graph
- Detect Cycle in Undirected Graph
- Detect Cycle in a Directed Graph (Part 1)
 Mind Coders The Future Is Here...
GREEDY
- Introduction to Greedy Algorithms
- Activity Selection Problem
- Activity selection
- Fractional KnapsackFractional Knapsack in Python
- Job Sequencing Problem - Huffman Coding (introduction)
- Huffman Algorithms
- Python Implementation of Huffman coding
BACKTRACKING
- Concept of backtracking
- Rat In a Maze
- N Queen Problem
- Sudoku Problem

DYNAMIC PROGRAMMING

- Introduction to DP
- Dynamic Programming Memoization
- Dynamic Programming Tabulation
- Longest Common Subsequence (Part 1)
- Longest Common Subsequence (Part 2)
- Variation of LCS - Coin Change Count Combinations
- Edit Distance Problem
- Edit Distance Problem DP solution
- Longest Increasing Sub sequence Problem
- Longest Increasing Subsequence O(nlogn)
- Variation of LIS (Part 1)
- Variations of LIS (Part 2)
- Maximum Cuts
- Minimum coins to make a value
- Minimum Jumps to reach the end
- 0-1 knapsack problem - 0
-1 knapsack problem DP Solution
 Mind Coders The Future Is Here...

Optimal Strategy for a Game

- Egg Dropping Puzzle
- Part 1 - Egg Dropping Puzzle - Part 2
- Count BSTs with n keys
- Maximum sum with no two consecutive
- Subset sum problem
- Subset Sum Problem (DP Solution)
- Matrix Chain Multiplication
- Matrix Chain Multiplication (DP Solution)
- Palindrome Partitioning
- Allocate Minimum Pages (Naive Method)
- Allocate Minimum Pages (DP Solution

TRIE
- Trie Data Structure (Introduction)
- Trie (Representation, Search and Insert)
- Trie Delete
- Count Distinct Rows in a Binary Matrix

SEGMENT AND BINARY INDEXED TREES

- Segment Tree (Introduction)
- Constructing Segment Tree
- Range Query on Segment Tree
- Update Query on Segment Tree
- Binary Indexed Tree (Intoductiion)
- Binary Indexed Tree (An Example Problem)
- Binary Indexed Tree (Prefix Sum)
- Binary Indexed Tree (Prefix Sum Implemention)
- Binary Indexed Tree (Update Operation)
DISJOINT SET
- Disjoint Set Introduction
- Find and Union Operations on Disjoint Sets
- Union by Rank
- Path Compression
- Kruskal's Algorithm
 Mind Coders
The Future Is Here...

Reach your audience and

C & C++
convert your leads
 Mind Coders The Future Is Here...

C - BASICS TO ADVANCED
INTRODUCTION
- Analysis of Algorithms
- Asymptotic Notation
- Big 0 notation
- Omega notation
- Theta notation
- Analysis of loops
- Time Complexity and Space Complexity

RECURSION
- Introduction
- Application
- Recursion practices
- Tail Recursion
- Writing Base Cases
- Print 1 to n and n to 1 using recursion

ARRAYS
- Introduction
- Operations on array
- Average of an array
- Maximum in array
- Second largest in array
- Check if array is sorted
- Reverse an array
- Rotate an array
SEARCHING
- Linear Search and its analysis
- Binary Search and its analysis
- Index of first and last occurrence
- Count occurrences in a sorted array
 Mind Coders The Future Is Here...

OPERATORS

- Arithmetic Operators
- Unary Arithmetic Operators
- Comparison Operators
- Assignment Operators
- Bitwise Operator inC (AND, OR and XOR)
- Bitwise Operator inC (Left Shift, Right Shift and NOT)
- Signed Number Representation and Bitwise Not
- Operator Precedence &Associativity
- Day before Ndays
- Sum of N Natural Numbers
- Last Digit of a Number

FLOW CONTROL
- If Else in C
- If Else Examples in C
- Else if with Example in C
- Switch inC - Even Odd Game
- Largest of Three Numbers
- Leap Year
- Simple Calculator
FUNCTION IN C
- Functions inC
- Application of Functions
- Function Declaration & Definition
- How FunctionWorks
- Inline Function
- Practice Problems on C Functions
- Recursion Practice Questions
- First Digit of a Number
- Prime Factorization
 Mind Coders The Future Is Here...

ARRAY

- Introduction to Array in C
- Declaring and Initializing Arrays
- Accessing Array Element
- Size of an Array in C
- Array Traversal in C
- Different Types of Arrays
- Check if Array is Sorted
- Count Distinct in an array
- Sum of an Array
- Average of and Array
- Maximum in an Array

POINTERS
- Address and DereferenceOperators in C
- Introduction to Pointers in C
- Application of Pointers in C
- Function Parameters and Pointers
- Array Parameters and Pointers
- Pointer Arithmetic
- Void Pointer in C
- NULL inC - Pointer vsArrays
- Pointer to Pointer in C

DYNAMIC MEMORY ALLOCATION

- Memory Structure of a Program
- malloc(), calloc() and free()
- Memory Leak
 Mind Coders The Future Is Here...

STRING IN C

- String in C (Introduction)
- String Syntax, Size and Length in C
- String Comparison inC
- String Copy inC
- String Concatenation in C
- Pattern Searching
- Strncat(), strncmp(), and strncpy()
- Substring search inC
- String Tokenization inC
- Reverse aString
- Check for palindrome
- String Binary to Decimal
- String Decimal to Binary

MULTI DIMENSIONAL ARRAY IN C

- Multi Dimensional Array in C

- Passing 2D Arrays as Argument To Functions
- Transpose of a Matrix
- Matrix Multiplication

STRUCTURE AND UNION

- Struct inC
- Structure Variable Initialization
- Structure Arrays
- Structure Pointer
- Structure Alignment
- Reason for Structure Alignment in C
- Union inC
- Application of Union
 Mind Coders The Future Is Here...

ADVANCED

- Function Pointers in C
- Passing Function to Pointers
- File Handling in C
- Read froma File
- Write to aFile
C++ BASICS
- Variable in C++ and Naming Rules
- Data Types in C++
- Range of Data Types
- Global variable and scope
- sizeof in C++
- static in C++
- const in C++
- auto in C++
- Literals in C++
- Type Conversion in C++
- Swap two numbers

INPUT OUTPUT IN C++

- Input in C++ (cin)
- Output in C++ (cout)
- Buffering in C++
- Escape Sequence in C++
- IO Manipulation
- Floating Point: Default Print Format, Manipulating Default format, fixed and
scientific
OPERATORS
- Arithmetic Operators
- Comparison Operators
- Logical Operators
 Mind Coders The Future Is Here...

FLOW CONTROL

- If Else
- Nested If Else
- Switch - Ternary
- Even Odd
- Largest of 3 numbers
- Leap Year
- Calculator Program

FUNCTION
- Introduction to function
- Function Definition and Declaration
- Inline function
- Function Overloading
- First Digit of a Number
- Prime Factorization
LOOPS
- For Loop
- While Loop
- Do while loop
- Continue
- Break
- Square Pattern
- Triangle Pattern
- Inverted Triangle Pattern
- Pyramid pattern
- Count Digits of a Number
- Factorial of a Number
- Check for Prime
- All Divisors of a Number
- GCD of Two Numbers
- LCM of Two Numbers
 Mind Coders The Future Is Here...

ARRAY

- Introduction to Arrays
- Declaration and initialization of an array
- Size of an Array
- Array Traversal
- Check if Array is Sorted
- Count Distinct in an array
- Sum of an array
- Average of an array
- Maximum in an array

REFERENCES
- References in C++
- Function Parameters & References
- Range based for Loop & References
- Const & R value References

POINTERS
- Address and Dereference Operators
- Introduction to Pointers
- Application of Pointers
- Function Pointer
- Array Parameter and Pointers
- Pointers vs Arrays
- Null in C++
- nullptr in C++
- Pointer Arithmetic
- Dynamic Memory Allocation
 Mind Coders The Future Is Here...

STRINGS

- Introduction to strings
- C style String in C++
- String class in C++
- Operation on strings
- String Comparison
- getline() in c++
- String Traversal
- Reverse a string
- Palindrome
- Pattern Searching

STRUCTURE AND UNION

- Struct in C++
- Struct vs Class in C++
- Structure (Pointer Array and Argument)
- Structure Alignment and Padding in C++
- Union in C++
- Complex Number using C++
VECTORS
- Introduction to vectors
- Vector Declaration
- Operation on Vectors
- Get Smaller Elements
- Separate Even Odd

MULTIDIMENSIONAL ARRAY
- Multidimensional Array in CPP
- Passing 2D array in as argument in CPP
- Transpose of a Matrix
- Matrix Multiplication
 Mind Coders The Future Is Here...

TEMPLATES IN C++
- Template in C++
- Function Template in C++
- Class Template in C++

OBJECT ORIENTED PROGRAMMING IN C++

- Object Oriented Programming in C++
- Constructor and Destructor
- This Pointer - Static Member in C++
- Inheritance
- Virtual Functions
- Multiple Inheritance
- Operator Overloading
- Friend Function

EXCEPTION HANDLING
- Exception Handling in C++
- Try throw and Catch in Exception Handling
- Stack Unwinding in Exception Handling
- User Defined Exception
ADVANCED
- Smart Pointer Introduction
-unique_ptr, shared_ptr and weak_ptr in C++
- Function Pointers
- Passing function as Parameters
- Lambda Expression
- Lambda Expression Examples
- Capture List in Lambda Expression
 Mind Coders The Future Is Here...

INTRODUCTION TO STL

- Templates in C++
- Importance of STL
- STL Containers and its Classifications
- Iterators
SIMPLE CONTAINERS
- Pairs

SEQUENCED CONTAINERS
- Vector
- Forward_list and List
- Dequeue
CONTAINER ADAPTERS
- Stack
- Queue
- Priority Queue

ASSOCIATIVE CONTAINERS
- Set & Multiset
- Map & Multimap
- Unordered_set
- Unordered_map
STL ALGORITHMS
- Non-Mutating STL Algorithms
- Mutating STL Algorithms
MISCELLANEOUS
- C++ string Class
- Manipulating STL
- builtin_popcount(), builtin_popcountll()
 Mind Coders The Future Is Here...

INTRODUCTION TO STL

- Templates in C++
- Importance of STL
- STL Containers and its Classifications
- Iterators
SIMPLE CONTAINERS
- Pairs

SEQUENCED CONTAINERS
- Vector
- Forward_list and List
- Dequeue
CONTAINER ADAPTERS
- Stack
- Queue
- Priority Queue

ASSOCIATIVE CONTAINERS
- Set & Multiset
- Map & Multimap
- Unordered_set
- Unordered_map
STL ALGORITHMS
- Non-Mutating STL Algorithms
- Mutating STL Algorithms
MISCELLANEOUS
- C++ string Class
- Manipulating STL
- builtin_popcount(), builtin_popcountll()
 Mind Coders
The Future Is Here...

PYTHON
Reach your audience and
convert your leads

FULL STACK
DEVELOPMENT
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Overview of Web Development
Introduction to Web Development
Overview of client-server architecture (discard)
Web Development Tools
Linux Commands

Introduction to Django

Installing Django
Creating the first project in Django
Difference between ASGI and WSGI Server
Creating a Django app and Understanding files Module

Templates and Template Language

Returning HTTP response from Django and understanding URLS

Understanding the namespace of URLs and request parameters in views
Creating Dynamic URLs in django
Class-based views vs. function-based views
Django template language
Template inheritance
Adding CSS
mini project using the Django template engine (Guess the lucky number ).

Django Models

Installing Databases Connecting with different DB like mysql and postgres ,

sqlite Defining models and fields Parameters in Django fields Relationships
between models
What is ORM and what benefits of using ORM Creating a CRUD operation using
Django shell
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Null vs Blank
Create vs Save vs get _or_create
How to use faker to insert fake data
Master django query searching filtering lookups, ordering
Overwrite save update method
Slug field in django
Bulk create in django
Meta classes in Django model
Understanding Soft delete and Object Manager in Django

Building Forms

Django HTML forms Django Model

forms Adding validation on files in
Django

Project - Expense Tracker

Expense tracker project setup

Designing ui of Expense tracker
Model the database
Form logic
Testing the application

Admin Interface
Django Admin overview
customizing the admin interface
security considerations
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE

Django Middleware
Introduction to middleware
Creating custom middleware
common use cases

User Authentication
Creating an authentication
Project in Django Protecting routes in Django
Overwrite Django user model
Customizing the Django User model

Django Signals

Introduction to signals
Aggregations
Annotations
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE

Django Middleware
Introduction to middleware
Creating custom middleware
common use cases

User Authentication
Creating an authentication
Project in Django Protecting routes in Django
Overwrite Django user model
Customizing the Django User model

Django Signals

Introduction to signals
Aggregations
Annotations
 Mind Coders
The Future Is Here...

JAVA
Reach your audience and
convert your leads

FULL STACK
DEVELOPMENT
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Java OOPS Fundamentals
Understand the fundamentals of Java OOPS concepts like Objects, Classes,
Inheritance, Polymorphism, Abstraction, and Encapsulation Learn how to handle
exceptions in Java Master the Singleton Design Pattern

Java 8 Functional Interfaces & Collections

Learn the differences between Abstract Classes and Interfaces with practical
examples
Explore Functional Interfaces, Lambda Expressions
Use Generics and Streams to write efficient code
Work with Java Collections for efficient data management

Multithreading & HashMap

Delve into the workings of HashMap
Understand the concepts of Multithreading, such as Thread creation, Thread
Groups, and Thread Join
Learn to differentiate between Sequential and Parallel Streams for effective task
execution

Maven for Project Management

Understand the need for Maven
Learn to work with POM.xml, explore different Maven Repositories and their
types
Understand the Maven Lifecycle for efficient project management

Spring Boot Basics

Learn the basics of Server and Client models
Introduction to Spring Boot
How to run application as a Server
Understand Embedded Servers like Jetty and Tomcat
Manage Logging Levels in Spring Boot
Work with Spring profiles and terminal commands
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
REST API & Spring MVC
Gain knowledge about REST API, HTTP Requests, and Responses
Learn to work with POSTMAN and CURL for API testing
Understand Annotations and Lombok
Explore the Spring MVC framework

Spring IOC & Dependency Injection

Learn about the Spring IOC container, Dependency Injection, and Enums
Understand the target of an Annotation
Configure Beans using @Configuration and @Bean annotations

Java Database Connectivity (JDBC)

Understand the differences between In-Memory and Disk Storage
Learn to connect a Spring Boot application with a Database Ser ver
Create Request Classes
Perform validations using JDBC
JPA & Hibernate
Understand the need for an abstraction layer between DAO and Database
Learn about JPA (Java Persistence API), Hibernate, Entity Classes, Annotations,
JPA Repository, and ResponseEntity

JPQL & Minor Project - Digital Library

Explore custom queries using JPQL (Java Persistence Query Language)
Learn about relationships in JPA
Work on a Digital Library [Minor Project]
Create a project flowchart

Digital Library [Minor Project] (Continued)

Continue working on the Digital Library [Minor Project]
Understand project HLSD
Data Modelling concepts
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Unit Testing with JUnit & Mockito
Learn to change the path of the local repository (.m2)
Parse CSV files with Spring Boot
Understand the importance of Unit Testing with JUnit and Mockito

Redis & Caching

Get introduced to Redis
Learn the differences between Cache and Cookie
Understand Server Cache vs. Browser Cache
Work with Local Redis Server
Online Centralized Redis Server for efficient caching

Spring Security & Authentication

Learn about Spring Security and its terminologies
Perform Basic Authentication using System Generated Credentials
Understand Authorization with In-Memory
Database user Authentication

Digital Library [Minor Project] (Continued)

Improvement and feature addition for Digital Library [Minor Project]
Gain insights into project overview, project HLSD, and project Data Modelling

Auth 2 & Github Integration

Introduction to Oauth2
OAuth 2.0 concepts
Learn the workflow of OAuth 2.0
Explore Scopes and Consent
Implement Github OAuth2 integration with Spring Boot

Microservies
Difference between Monolith Architecture and Microservices Architecture
Load Balancing Algorithms and Introduction to Eureka Server
Learn about the Consumers and Producers Model.
Intercommunication between Microservices using Feign client.
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE

Kafka Integration with Microservices and Spring Cloud

Learn about Message Queues and their types
Integrate Kafka with Spring Boot
Introduced to Kafka Message Queue for efficient messaging systems.
Introduction to Spring Cloud and its configuration & hystrix circuit breaker

E-Wallet App like Paytm [Major Project Part 1]

Start working on E-Wallet App like Paytm
Project Overview
Project HLSD Project Data Modelling
Building Microservice Architecture

E-Wallet App like Paytm [Major Project Part 2]

Major Project Continued
Project Queries
Career Guidance
 Mind Coders
The Future Is Here...

MERN
Reach your audience and
convert your leads

FULL STACK
DEVELOPMENT
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 1: An Introduction to HTML
What is HTML?
A Simple HTML Document
What is an HTML Element?

Module 2: Beginning HTML Basics

HTML Documents
HTML Tags
HTML Headings
HTML Paragraphs
HTML Images
HTML Links

Module 3: Main Topics of HTML

HTML Attributes
HTML Attributes
HTML Formatting
HTML Forms
HTML Tables
HTML Lists
HTML Classes
HTML IFrames
HTML Comments
Module 4: Main Topics of CSS
CSS Text
CSS
Backgrounds
CSS Images
CSS Colors
CSS Margins
CSS Padding
CSS
Height/Width
CSS Fonts
CSS Position
CSS Z-index
CSS Opacity
CSS Align
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 1: An Introduction to HTML
What is HTML?
A Simple HTML Document
What is an HTML Element?

Module 2: Beginning HTML Basics

HTML Documents
HTML Tags
HTML Headings
HTML Paragraphs
HTML Images
HTML Links

Module 3: Main Topics of HTML

HTML Attributes
HTML Attributes
HTML Formatting
HTML Forms
HTML Tables
HTML Lists
HTML Classes
HTML IFrames
HTML Comments
Module 4: Main Topics of CSS
CSS Text
CSS
Backgrounds
CSS Images
CSS Colors
CSS Margins
CSS Padding
CSS
Height/Width
CSS Fonts
CSS Position
CSS Z-index
CSS Opacity
CSS Align
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 5: Advanced CSS
CSS 2D/3D Transform
CSS Transitions
CSS Effects
CSS Animations
CSS Buttons
CSS Media Query

Module 6: An Introduction to JS
What is JavaScript?
Way of adding JavaScript
Syntax
Display
Identifiers
Variables
Rules
Module 7: Main Topics of JS
JavaScript Operators
JavaScript Arithmetic
JavaScript Assignments
JavaScript Data Types
JavaScript Functions
JavaScript Objects
JavaScript Strings
JavaScript Events
JavaScript Arrays
JavaScript Booleans
JavaScript If else
JavaScript Switch
JavaScript Loops

Hands-on Practicals:

Login & Signup Form

Blogging Website
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 9: Main Topics of Bootstrap
BS Introduction
BS Get Started
BS Grid Basic
BS Typography
BS Tables
BS Images
BS Jumbotron
BS Wells
BS Alerts
BS Buttons
BS Button Groups
BS Glyphicons
BS Badges/Labels
BS Progress Bars
BS Pagination
BS Pager
BS List Groups
BS Panels
BS Dropdowns
BS Collapse
BS Tabs/Pills
BS Navbar
BS Forms
BS Inputs & Inputs 2
BS Input Sizing
BS Media Objects
BS Carousel
BS Modal
BS Tooltip
BS Popover
BS Scrollspy
BS Affix
BS Filters
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 10: Bootstrap Grids
BS Grid System
BS Stacked/Horizontal
BS Grid Small
BS Grid Medium
BS Grid Large
BS Grid Examples
Module 11: Bootstrap CSS Ref
CSS All Classes
CSS Typography
CSS Buttons
CSS Forms
CSS Helpers
CSS Images
CSS Tables
CSS Dropdowns
CSS NavsGlyphicons
BS Theme "Company"
Module 12: Bootstrap JS Ref
JS Affix
JS Alert
JS Button
JS Carousel
JS Collapse
JS Dropdown
JS Modal
JS Popover
JS Scrollspy
JS Tab
JS Tooltip

Hands-on Practicals:
Login & Signup Form
Portfolio Website
E-commerce Portal
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 1: What is React JS?
React JS Introduction
Advantages of React JS
Work flow of React JS
Scope of React JS
Module 2: Overview of JSX
Introduction of Virtual DOM.
Difference between JS and JSX.
React Components overview
Containers and components
What are Child Components?
What are Namespaced components?
What are the JavaScript expressions available in
JSX?
Module 3: React JS Environment Setups
Node setup How to use NPM?
How to create package.json and
purpose of it?
ES6 Introduction and features.
Webpack Overview Best IDE for React
JS and How to write optimized code in
React JS? React JS browser plugins
overview.

Hands-on Practicals:
NPM Installation by locally and
Globally Create a Basic App with
React JS and other Supported NPMs

Module 4: React JS forms and UI

Lists of Form components.
Setup Controlled and Uncontrolled form
components.
Control Input elements.
How to set default values on all formats of
Input elements.
React JS Form validations. How to write
Styles? Animations overview

Hands-on Practicals:
Create a React Form.
Client-side form validation.
Applying form components.
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 5: React JS Component Life Cycles Overview
Initial Render Props
Change Stage Change
Component willmount
Component didMount
Component Unmount
Hands-on Practicals:
Applying Different Life Cycles in the
Application.
When to choose Appropriate lifecycles.
Module 6 : Event Handling in JSX
onBlur, onKeyUp, onChange, and other useful primary
events in React JS.
How to Share events between the components?
Module 7: How to write Styles in React JS?
CSS and inline styles in React JS overview.
Introduction to styled-components

Hands-on Practicals:
Styling the application using styled component
How to use Animations in the Application.
Module 8: React Router with Navigation
How to Load the router library?
Configure the React Router?
How to Pass and receive parameters?
Integration of React-cookie overview.

Module 9: Flux, Redux overview

What is Flux Architecture?
What are the Flux Components available?
Stores.
Dispatchers.
View Controllers.
Actions.
Views.
How does Flux work?
Flux and React work together.
Introduction to One Store.
Provider Component
Actions.
Reducers.
sagas
Dispatchers
View Controllers
Selectors
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 10: Hooks
Understanding Hooks
The useState hook
Side effects using the useEffect hook
The useContext hook
The useReducer hook
Writing your own hook

Module 11: Code Splitting

Code splitting & Suspense
Route Based Code Splitting
Lazy Loading
Module 12: INTRODUCTION TO NODE
WORLD
Introduction to Javascript event-driven
programming
Introduction to Node event-driven
programming
Module 13: MAKING A WEB SERVER
Web Server basis
Handling incoming requests in Node JS
Serving static files/pages
Content caching
Streaming and optimization
Handling filesystem

Module 14: Rest API & HTTP OBJECT

Rest API benefits
Introduction to HTTP Object
Processing POST Data
Handling File uploads
Using Node as HTTP Client
Implementing download Throttling
Node JS way of calling another server

Module 15: WORKING WITH DATA

SERIALIZATION
JSON to Object & Object to JSON
Module 16: WORKING WITH DATABASES
(Preferred MongoDB over MYSQL)
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 17: WEB DEVELOPMENT WITH
EXPRESS
Express scaffolding
Defining and applying environments
Dynamic routing
Templating IN Express
CSS engines with Express
How to use JWT benefit of using JWT
over Sessions
Demo of making an Express web
application
File System Security issues and
measures
Module 18: ADVANCED NODE CONCEPTS
Sending Emails Sending SMSs
What is a web socket?
Communication using sockets!

Module 19: WRITING CUSTOMIZED

NODE MODULES
Writing a functional mdoule
Extending the module’s API
Deploying a module to npm

Module 20: GETTING IT TO PRODUCTION

How to set up a production server
environment
How to set up auto crash recovery
 Mind Coders The Future Is Here...

WEEKLY SCHEDULE
Module 17: WEB DEVELOPMENT WITH
EXPRESS
Express scaffolding
Defining and applying environments
Dynamic routing
Templating IN Express
CSS engines with Express
How to use JWT benefit of using JWT
over Sessions
Demo of making an Express web
application
File System Security issues and
measures
Module 18: ADVANCED NODE CONCEPTS
Sending Emails Sending SMSs
What is a web socket?
Communication using sockets!

Module 19: WRITING CUSTOMIZED

NODE MODULES
Writing a functional mdoule
Extending the module’s API
Deploying a module to npm

Module 20: GETTING IT TO PRODUCTION

How to set up a production server
environment
How to set up auto crash recovery
 Mind Coders The Future Is Here...

QUESTION & ANSWER

What is the DSA program?

The Data Structures and Algorithms (DSA) program is a course

designed to teach the fundamental concepts of data structures
and algorithms, which are critical for efficient problem-solving
and coding.

What technologies are included in Python Full Stack

development?

Python Full Stack includes Python for backend, Django/Flask

as the framework, HTML/CSS for front-end, and databases like
MySQL or PostgreSQL.

What are the prerequisites for learning Python

Full Stack?

Basic understanding of programming concepts, HTML/CSS, and

knowledge of Python is recommended but not mandatory.
 Mind Coders The Future Is Here...

QUESTION & ANSWER

What is the scope of Java Full Stack development?

Java Full Stack developers are in demand in industries such as

enterprise applications, banking, e-commerce, and cloud-
based platforms.

What technologies are included in Java

Full Stack development?

Java Full Stack includes Java, Spring Boot for backend,

Angular/React for frontend, and databases like MySQL or
MongoDB.

Is MERN Full Stack suitable for beginners?

Yes, MERN is beginner-friendly, especially for those with a

basic understanding of JavaScript, as it uses JavaScript
throughout the stack.
Contact Information
Phone: +91-7674040233, +91-7389640233
Website: www.mindcoders.in
Email: [email protected] #206, Pearl Business
Address: Park, In front of Vishnu
Puri iBus Stop, Bhanwar Kuwa, Indore 452014