Course Modules
| Module | Description | Duration | Focus Area |
|---|---|---|---|
| 1 | Inducing the Aspirant’s Logical abilities from the angle of Technical Perspective with the flavor of Mathematics and Formulae Derivation. | 30 Hrs | Logic Building |
| 2 | Making Proficient in 1 Programming Language among (C/C++, JAVA, Python) with Problem Solving Skills through Data Structures and Algorithms | 30/42/30 Hrs | Tech Conceptual Skills |
| 3 | Value Added Courses (VAC): Computer networks, DBMS, CO, Operating Systems, Cloud Computing, IOT | 39 Hrs | Value Added Courses |
| 4 | Problem Solving through the Data structures and Algorithms of Problem Solving Strategies | 135 Hrs (93 Hrs + 42 Hrs) | Problem Solving through DSA |
| 5 | Full Stack Development Frameworks within Java and Python | 48 Hrs | Full Stack Frameworks |
| Total Number of Hours | 282 Hrs to 294 Hrs | ||
| [Module 1 - Logic Building]
Key Points |
|
|---|---|
| Module | Common Building Blocks – Programming Language Constructs – Logic Building |
| Objectives |
|
| Pre-Requisites | Trainees should be Sincere with Learning Attitude and have basic knowledge on C/C++/Java/Python |
| Duration | 30 Hrs. Theory |
| Selection Criteria | Assessment Test (Optional) |
| Batch Size | Max. 150 per Trainer |
| Forwards upon Better Performance |
|
| S. No | List of Topics | No. of Hrs |
|---|---|---|
| 1 | Number Systems | 1 |
| 2 | Binary Number System | 1 |
| 3 | 8 bit/16 bit/32 bit/64 bit Unsigned Patterns | 1 |
| 4 | 8 bit/16 bit/32 bit/64 bit Signed Patterns | 2 |
| 5 | Data Ranges | 1 |
| 6 | Fibonacci Series | 6 |
| 7 | Prime Numbers | 3 |
| 8 | GCD, LCM | 6 |
| 9 | Factorials | 3 |
| 10 | Arithmetic | 6 |
| Total No of Theory Hrs for Module 1 | 30 | |
| Key Points | Details |
|---|---|
| Module Info | Technical Conceptual Skills – Programming Language Skills |
| Objectives | Preparing students for Placements in Service Based Companies, Learning a Programming Language and becoming proficient in that. |
| Pre-Requisites | Module 1 Passing with Prior set Eligibility Criteria, Pre-Qualifying Assessment Test (If Module 1 not attended) |
| Duration | 30 Hrs. for C/C++, Python 42 Hrs. for JAVA |
| Selection Criteria | Pre-Qualifying Assessment Test (Mandatory) |
| Batch Size | Max. 150 per Trainer |
| Forwards upon Better Performance | Module 3, Module 2 Solidifying |
| S. No | List of Topics | No. of Hrs |
|---|---|---|
| 1 | Basic Programming Constructs, Data types | 1 |
| 2 | Decision Making Statements, Loops | 2 |
| 3 | Patterns | 3 |
| 4 | Functions & Recursion | 3 |
| 5 | Arrays | 3 |
| 6 | Strings | 3 |
| 7 | Searching & Sorting | 3 |
| 8 | Pointers | 3 |
| 9 | Files | 3 |
| 10 | Structures And Union | 3 |
| 11 | DMA | 3 |
| Total No of Theory Hrs. for Module 2 | 30 | |
| S. No | List of Topics | No. of Hrs. |
|---|---|---|
| 1 | Introduction to JVM, JRE, JDK, Class Loading subsystem | 3 |
| 2 | Introduction to OOPS: Data Abstraction, Encapsulation | 3 |
| 3 | Polymorphism, Static Vs Dynamic Binding | 3 |
| 4 | Inheritance | 3 |
| 5 | Packages and Access Control | 3 |
| 6 | Exception Handling | 3 |
| 7 | Abstract Classes | 3 |
| 8 | Interfaces in and after JDK8 | 3 |
| 9 | Inner Classes | 3 |
| 10 | Multi-Threading, Producer Consumer Problem | 3 |
| 11 | Collections and Generics | 12 |
| Total No of Theory Hrs. for Module2 | 42 | |
| S. No | List of Topics | No. of Hrs. |
|---|---|---|
| 1 | Basics | 1 |
| 2 | Data Types and Operators | 2 |
| 3 | Control Statements | 3 |
| 4 | Strings | 3 |
| 5 | Lists | 3 |
| 6 | Tuples | 3 |
| 7 | Sets | 3 |
| 8 | Dictionary | 3 |
| 9 | Functions | 3 |
| 10 | OOPS | 3 |
| 11 | NumPy | 3 |
| Total | Theory Hrs. | 30 |
| Key Points | Details |
|---|---|
| Module Info | Value Added Courses – Computer Networks – DBMS – OS – Cloud Computing – IOT |
| Objectives | Mastering in Company Specific Topics, Learning above-mentioned value-added courses and becoming proficient in them. |
| Pre-Requisites | Module 2 Passing with Prior set |
| Eligibility Criteria | Pre-Qualifying Assessment Test (If Module 2 not attended) |
| Duration | 39 Hrs. (30 Hrs. Theory & 42 Hrs. Practical) |
| Selection Criteria | Pre-Qualifying Assessment Test (Mandatory) |
| Batch Size | Max. 150 per Trainer |
| Forwards upon Better Performance | Module 4 |
| Module 3 Solidifying | Conver to HTML table |
| S. No | List of Topics | No. of Hrs. |
|---|---|---|
| 1 | Computer Networks – Theory | 3 |
| 2 | Computer Organization – Theory | 3 |
| 3 | Computer Networks – Problems (Company Specific Content) | 6 |
| 4 | Computer Organization – Problems (Company Specific Content) | 6 |
| 5 | SQL in DBMS | 6 |
| 6 | PLSQL in DBMS | 6 |
| 7 | Operating Systems – Process Management – Theory | 1 |
| 8 | Operating Systems – Process Management – Problems | 2 |
| 9 | Cloud Computing – Essentials for Placement Test | 3 |
| 10 | IOT – Essentials for Placement Test | 3 |
| Total No of Hrs. for Module 3 | 39 | |
| Key Points | Details |
|---|---|
| Module Info | Data Structures and Algorithms – Built in Libraries |
| Objectives |
|
| Pre-Requisites | Module 3 Passing with Prior set |
| Eligibility Criteria | Pre-Qualifying Assessment Test (If Module 3 not attended) |
| Duration | 135 Hrs. (93 Hrs. Theory and 42 Hrs. Practical) |
| Selection Criteria | Pre-Qualifying Assessment Test (Mandatory) |
| Batch Size | Max. 150 per Trainer |
| Forwards upon Better Performance |
|
| S. No | List of Topics | No. of Hrs |
|---|---|---|
| 1 | Bit Manipulation | 2 |
| 2 | Time and Space Complexity | 2 |
| 3 | Hash Set and Hash Map/ Dictionary | 6 |
| 4 | Stack – Queue | 6 |
| 5 | Heap – MaxHeap – MinHeap – Heap Sort – Priority Queue | 6 |
| 6 | Sieve Algorithm, Concepts and Variations | 3 |
| 7 | Linked Lists with Recursion and NonRecursion | 6 |
| 8 | Trees – Binary Trees – BST – AVL Trees | 12 |
| 9 | Graphs – Traversals | 3 |
| 10 | Dynamic Programming | 18 |
| 11 | Graph Algorithms | 12 |
| 12 | Greedy Algorithms | 3 |
| 13 | Divide and Conquer Problems | 3 |
| 14 | Back Tracking as Problem Solving strategy | 3 |
| 15 | Sliding Window and Two Pointer Technique | 6 |
| Total No of Theory Hrs. for Module4 | 93 |
| S. No | Practice Problems/Contests/Platform | No. of Hrs |
|---|---|---|
| 1 | VJudge Contest on Bit Manipulation | 3 |
| 2 | MCQ Based Assessment Test on Time and Space Complexity | 3 |
| 3 | VJudge Contest on Set and Map | 3 |
| 4 | VJudge Contest on Stack and Queue | 3 |
| 5 | VJudge Contest on PriorityQueue Based Problems | 3 |
| 6 | MasterPick Practice Problems on Linked List | 3 |
| 7 | MasterPick Practice Problems on Trees | 3 |
| 8 | MasterPick Practice Problems on Graphs | 3 |
| 9 | MasterPick Practice Problems on Dynamic Programming | 6 |
| 10 | MasterPick Practice Problems on Greedy Algorithms | 3 |
| 11 | MasterPick Practice Problems on Divide and Conquer Algorithm | 3 |
| 12 | MasterPick Practice Problems on Backtracking Algorithms | 3 |
| 13 | VJudge Contest on Sliding Window and Two Pointer Techniques | 3 |
| Total No of Practical Hrs. for Module 4 | 42 | |
| Key Points | Advanced Java – Full Stack Frameworks |
|---|---|
| Objectives |
|
| Pre-Requisites | Module 4 Passing with Prior set |
| Eligibility Criteria | Pre-Qualifying Assessment Test (If Module 4 not attended) |
| Duration | 48 Hrs. |
| Selection Criteria | Pre-Qualifying Assessment Test (Mandatory) |
| Batch Size | Max. 150 per Trainer |
| Forwards upon Better Performance |
|
| S. No | List of Topics | No. of Hrs |
|---|---|---|
| 1 | Web 3.0 – HTML – CSS - JavaScript | 3 |
| 2 | Ajax, Jquery | 3 |
| 3 | Java Servlets | 6 |
| 4 | JSP | 6 |
| 5 | CRUD Operations | 6 |
| 6 | Hibernates | 9 |
| 7 | Springs Framework | 12 |
| 8 | Mern Stack Orientation | 3 |
| Total No of Theory Hrs. for Module5 | 48 | |
* All the Module can be customized