Java with DSA
Part 1 – Core Java (16 Hours)
1. Introduction & Setup (1 Hour)
What is Java? History, Features, and Applications
Advantages of Java over other programming languages
Java Installation: JDK, JRE, JVM Explained
Setting up IDEs: IntelliJ IDEA, Eclipse, VS Code
Understanding JVM Architecture (Classloader, Memory, Execution Engine)
2. Java Foundations (3 Hours)
Variables & Data Types
Primitive vs Non-Primitive Types
Type Casting, Type Conversion
Naming Conventions
Standard coding practices for cleaner code
Operators in Java
Arithmetic, Relational, Logical, Assignment, Unary, Ternary
Decision Making
if, if-else, nested if
switch-case with examples
Looping Constructs
for loop, while loop, do-while loop
break, continue, exit usage
3. OOP Basics (4 Hours)
Introduction to Classes & Objects
Defining classes, creating objects
Object lifecycle & memory allocation
Methods
Declaring, invoking, return types, parameters
Constructors
Default, parameterized, copy constructor
this & static Keyword
Class-level variables, static blocks
Core OOP Concepts
Inheritance (single, multilevel, hierarchical)
Polymorphism: Method Overloading & Overriding
Abstraction (abstract classes, interfaces)
Encapsulation (getters, setters, access modifiers)
4. Advanced OOP (3 Hours)
Aggregation & Association with real-life examples
Composition, Cohesion, and Coupling
Use of super keyword and final keyword
Method Binding: Compile-time vs Runtime
Solving the Diamond Problem with Interfaces
5. Java Utilities (3 Hours)
Strings in Java
String Pool, Immutable Strings
String methods: length(), charAt(), substring(), equals()
Arrays
1D Arrays: Creation, Traversal, Insertion, Deletion
2D Arrays: Representation, Applications (Matrix Problems)
Collections Framework Overview
List (ArrayList, LinkedList), Set (HashSet, TreeSet), Map (HashMap, TreeMap)
When to use which Collection
6. Java Essentials (2 Hours)
Exception Handling
try, catch, finally throw vs throws
Custom Exceptions
File Handling
Reading from & Writing to files
Packages & Access Modifiers
Public, Private, Protected, Default
Creating and Importing Packages
Regular Expressions (Regex)
Pattern Matching in Strings
Part 2 – Data Structures & Algorithms (24 Hours)
7. Algorithm Foundations (2 Hours)
Asymptotic Analysis
Big O, Big Ω, Big Θ Notations
Best, Worst, Average case complexities
Recursion
Base case, Recursive tree, Call stack
Mathematical Foundations
GCD (Euclidean Algorithm), LCM
Modular Arithmetic
Prime Numbers (Sieve of Eratosthenes)
8. Arrays & Searching (3 Hours)
Basic Array Operations (Insertion, Deletion, Update)
Two Pointer Technique
Pair Sum, Triplet Sum, Removing Duplicates
Sliding Window Technique
Maximum Subarray Sum of size K
Variable Window Problems (Longest Substring without Repeating Characters)
Searching Algorithms
Linear Search
Binary Search (Iterative & Recursive)
9. Sorting (2 Hours)
Basic Sorting Algorithms (Overview)
Bubble Sort, Selection Sort, Insertion Sort
Efficient Sorting (Deep Dive)
Merge Sort (Divide & Conquer)
Quick Sort (Pivot, Partition Logic)
10. Greedy Algorithms (2 Hours)
Introduction to Greedy Method
Classic Problems
Activity Selection Problem
Job Sequencing Problem
Fractional Knapsack
Huffman Coding (Greedy Tree Construction)
11. Prefix, Kadane & Advanced Arrays (2 Hours)
Prefix Sum Arrays
Difference Array Technique
Kadane’s Algorithm for Maximum Subarray Sum
Variants of Kadane (max sum with one deletion, circular array sum)
12. Linked List, Stack & Queue (3 Hours)
Linked List
Singly, Doubly, Circular
Insertion, Deletion, Traversal
Slow & Fast Pointer Technique
Detecting cycle in Linked List
Finding middle node
Stack & Queue
Implementation using Array & Linked List
Monotonic Stack/Queue Problems
13. Trees & BST (3 Hours)
Tree Basics
Representation, Terminology (Nodes, Edges, Height, Depth)
Traversals
DFS: Preorder, Inorder, Postorder
BFS: Level Order
Binary Search Trees (BST)
Insertion, Deletion, Search
Heaps & Priority Queues
Min-Heap, Max-Heap
Applications: K largest elements, Heap Sort
14. Graphs (4 Hours)
Graph Representation
Adjacency Matrix, Adjacency List
Graph Traversals
DFS, BFS
Topological Sorting
Kahn’s Algorithm, DFS Approach
Connected Components
Union-Find (Disjoint Set Union)
Shortest Path Algorithms
Dijkstra’s Algorithm
Bellman-Ford Algorithm
Minimum Spanning Trees
Prim’s Algorithm
Kruskal’s Algorithm
15. Dynamic Programming (3 Hours)
Introduction: Memoization vs Tabulation
1D DP Problems
Fibonacci Numbers, Climbing Stairs
2D DP Problems
Unique Paths, Grid Path Problems
Classic DP Problems
0/1 Knapsack
Subset Sum
Longest Increasing Subsequence (LIS)
Key Outcomes for Students
Master Core Java → OOP, Collections, Exception Handling, File Handling
Strong DSA Base → Arrays, Strings, Linked Lists, Trees, Graphs, DP
Interview-Ready → Learn 20+ Must-Know Algorithms & Problem-Solving Patterns
For Queries: 9842191947 | info@[Link] For Registration [Link]
