Mastering Java with Data Structures
and Algorithms
Duration: 120 Hrs
Level 1 – 60 Hrs
Level 2 – 60 Hrs
Program Objective :
To enable developers to write code that runs on any device with a Java Virtual Machine (JVM), promoting reusability and portability.
Program Outcomes:
- Preparing the candidates to crack Interviews’
- Providing Code Optimization Technique
- Choosing the Best Data Structures to Solve the problems
- Solving the problems with less time and applying the best
Modules:
Level 1 – Mastering Java-60 Hours
- Oops Concepts
- Classes, Objects, Interfaces, Exception Handling
Level 2 – (A) Data Structure and Algorithms-30 Hours
- Stacks, Queue, Linked List, Trees, Graphs
(B) Collection Framework and Stream API-30 Hours
- Collection Framework
- Stream API
- Lamba Expression
Project Stream:
- Java
- Collection Frame work
Platform:
- Eclipse IDE
| Module 1: Java – 60 Hours | ||
|---|---|---|
| Introduction to Core Java | Features of Java | C++ VS Java |
| Hello Program and Structure | Environment Setup | JDK, JRE and JVM |
| Variables | Data Types | Operators |
| Control Statements | Oops and Object class | Arrays |
| Static, this, super keyword | Inheritance | Abstraction and Encapsulation |
| Polymorphism | String | StringBuffer and StringBuilder |
| Exception Handling | Multithreading | Problem Solving in Hackerrank/Leetcode |
| Module 2: Data Structures using Java – 30 Hours | ||
| Linked List Concepts – SLL, DLL (creation, traversal, insertion, deletion) | Reverse a Linked List | Stack – Concepts, Applications (balanced parentheses, postfix eval) |
| Queue – Concepts, Applications | Queue Using Array and Linked List | Circular Queue, Deque |
| Trees – Binary Tree, Binary Search Tree (BST) | Tree Operations – Insert, Delete, Traverse (Inorder, Preorder, Postorder) | Graph – Adjacency Matrix/List, BFS, DFS |
